Grammatical systems just might be the type of thing Tegmark is looking for that is a framework for all mathematical structures... or at least a large class of them.
I am still exploring the idea of grammatical system induction. I believe it can be used to provide an induction principle that allows one to prove something about all sets in ZFC (or any set theory). Applying the general grammatical system induction to formal systems, I believe there is a way to prove something about all theorems within a formal system, perhaps providing a little insight into truth in general. Also, an induction principle applies to all proofs if one wants to prove something about all proofs in a formal system. The document in the first post has been updated to include all of this. There are some words I need to change so just notice the essence... Any feedback is appreciated! -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
