- #36
yougene
- 35
- 0
True enough, however the nature of axioms are universal regardless of what construct they are used in.Hurkyl said:No it doesn't. It only applies to
consistent formal, computably enumerable theories that prove basic integer arithmetical truths.Those are the hypotheses of the theorem, and thus are the only things that this theorem can prove incomplete.
I'm just an armchair thinker here so you'll have to forgive my lack of in depth experience with either one of those. My understanding is it's impossible to have a construct be both simultaneously complete AND consistent due to the fact that all constructs rest on axioms. It's just the nature of the relationship we have with reality. We can clearly see that 1 + 1 = 2, and use that as an axiom to build up the construct consistently however you can't use that construct to prove that 1 + 1 = 2, since the construct assumes that it's true already. In the end it would be like saying 1 + 1 = 2 therefore 1 + 1 = 2.The elementary theory of Euclidean geometry and the elementary theory of real number arithmetic are notable examples of consistent formal, computably enumerable, complete theories. (In fact, they are essentially the same theory)
A theory can prove it's own consistency, it just can't be complete at the same time.Furthermore, I'm fairly certain that there exist consistent formal theories that can prove their own consistency. (which, of course, requires that the theory fails to include integer arithmetic, or that it fails to be computably enumerable)
True enoughNo, they are said to be incomplete in the sense that there exists a statement in its language that it can neither prove nor disprove.