2 ms·
Yes. To avoid paradoxes you need to limit nesting, inlined or not. This statement reeks of uncontrolled infinities with all the quantifiers and I don't even kno
by scotty79 5y ago
Yes. To avoid paradoxes you need to limit nesting, inlined or not. This statement reeks of uncontrolled infinities with all the quantifiers and I don't even know what some symbols mean like 0''' Because of my ignorance I can't point the exact problem here but I don't think it is the multiplication.
Alternatively you might just redefine the concept of something being true such that you only provable things are true and unprovable ones are either false, undecidable or nonsensical.
And nonsensical thing is defined as a statement thats unprovable but seemingly true.
I think there many ways to fix this just by restricting yourself with how you define things. And it's not about restricting arithmetc because that's not the core of the issue, that's just the (simplest?) example.
- rssoconnor 5y agoSo your problem is with the use of unbounded quantifiers that range over all natural numbers? So for example you would consider "∀x. ∀y. x + y = y + x" a nonsense statement because we are quantifying over all natural numbers, and there are an infinite number of natural numbers, so we cannot quantify over them? (For the record the ' in 0' or x1' is a post-fix notation for the successor operation. See http://tachyos.org/godel/proof.html http://tachyos.org/godel/proof.html for details).
- scotty79 5y agoI don't know what the problem with that particular long statement is. You might just say that a thing is nonsensical if it's not provable but is not false either. This might be sensible 'stack overflow' exception if we really are unable to provide reasonable limits on self reference reference and reasoning relying on infinities.
- rssoconnor 5y agoNonsensical if it's not provable with respect to what theory exactly? Elementary function Arithemetic? Primitive Recursive Arithemetic? Peano Arithemtic? Martin-Löf type theory? ZF set theory? ZFC+"there exist an infinite number of Woodin cardinals"? "The set of true statements of number theory"? Each of these logical theories are each able to prove an increasing number of arithmetic propositions. What is or is not provable is relative the deduction system or selection of axioms. For example, that big expression that I linked to is designed so that isn't provable in Peano Arithmetic, but it will be provable Martin-Löf type theory, ZF set theory, etc.
- scotty79 5y agoIf it's not provable and not false in F it's nonsensical in F. Might become sensible with more axioms. I'd like to ask you a question... Can you take the expression you linked to and add its negation as the additional axiom to Peano arithmetic? Or would it lead to some contradictions?