Is Godel's system of axioms inconsistent?

  • Thread starter Thread starter Ursole
  • Start date Start date
  • Tags Tags
    Godel
AI Thread Summary
The discussion revolves around the consistency of Godel's system of axioms, particularly ZFC. It highlights that while Godel's theorem indicates any consistent mathematical theory with a model of natural numbers is incomplete, it does not directly imply ZFC's inconsistency. The participants note that if a statement is unprovable in one consistent system, it can be provable in another consistent system. They emphasize that Godel's proof relies on the assumption of consistency, and if a formula asserting "ZFC is consistent" can be expressed, it cannot be proven true unless ZFC is indeed inconsistent. The conversation underscores the complexities surrounding the proofs of consistency in mathematical theories.
Ursole
Messages
28
Reaction score
0
As we cannot prove that Godel's system of axioms (ZFC?) is consistent, is it possible that it is inconsistent, that the Godel sentence is false, and that we yet prove it to be 'true'?
 
Last edited:
Physics news on Phys.org
When using an inconsistent system, any statement can be proven true.

If a statement is unprovable in one consistent system, then there is a consistent system in which this statement is provable, and there is another consistent system in which this statement is disprovable.
 
I.e., yes.

Godel's theorem says that "any consistent mathematical theory containing a model of the natural numbers is incomplete". (The conditions on the theory are a bit stronger than that, but the consistent requirement is part of the statement.)

If you follow his proof, you can see exactly where he assumes consistency of the theory, though it has been long enough that I have forgotten.
 
I may be wrong, but I don' t think it's a consequence of Godel that we can't prove ZFC consistent. We can prove all kinds of things to be consistent. What Godel says is that if we can write a formula in the language of ZFC that says "ZFC is consistent", then we can't prove it unless ZFC is really inconsistent.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top