Questions: ZFC Axiom System: Consistency and Gödel's Limits

Question 1

Gödel proved in 1940 that ZFC cannot disprove the Continuum Hypothesis (CH), and Cohen proved in 1963 that ZFC cannot prove CH. What is the correct interpretation of these two results together?

• A. CH is false, but ZFC is too weak to detect the contradiction
• B. CH is true in some models of ZFC and false in others — it is independent of (undecidable within) ZFC
• C. ZFC is inconsistent, since it cannot determine the truth value of CH
• D. CH is a meaningless statement because it concerns infinite sets that cannot be formally defined

Answer: (B)

When a statement S is consistent with a formal system F (F cannot disprove S) AND the negation ¬S is also consistent with F (F cannot prove S), S is called *independent* of F. Both CH and ¬CH are consistent with ZFC — each can be the case in some model of ZFC without contradiction. This does not mean CH has no truth value; rather, ZFC's axioms do not determine which value it has. Mathematicians can extend ZFC with additional axioms (like large cardinal axioms) that do determine CH, but those extensions are themselves not provable within ZFC.

Question 2

Why does Gödel's Second Incompleteness Theorem prevent ZFC from proving its own consistency?

• A. ZFC's axioms are too weak to express statements about consistency
• B. A proof of ZFC's own consistency could be formalized inside ZFC, and a diagonal argument would then show ZFC is inconsistent — so any consistent ZFC cannot contain such a proof
• C. Consistency proofs require an infinite number of axioms, which ZFC cannot accommodate
• D. ZFC's axiom of choice creates circular dependencies that block self-referential reasoning

Answer: (B)

The Second Incompleteness Theorem states that any consistent formal system strong enough to express basic arithmetic cannot prove its own consistency. The argument is roughly: if ZFC proved 'ZFC is consistent,' that proof could be internalized as a finite arithmetic statement within ZFC. But Gödel's first theorem shows there is a true-but-unprovable statement P in any consistent system of this strength. If ZFC could prove its own consistency, it could also prove P (using the consistency proof as a premise), contradicting the unprovability of P. So ZFC's consistency, if true, is unprovable within ZFC. This is not a practical defect — it is a structural ceiling on formal self-justification.

Question 3

The Continuum Hypothesis being 'consistent with ZFC' means it is provable from the ZFC axioms.

• T. True
• F. False

Answer: False

Consistency and provability are very different. 'CH is consistent with ZFC' means you cannot derive a contradiction from ZFC + CH — adding CH to ZFC does not break it. But CH is *not provable* from ZFC alone: you need the additional axiom CH (or an equivalent) to prove it. Gödel's result showed consistency; it took Cohen's later forcing technique to show that ¬CH is also consistent. Together they established independence: neither CH nor ¬CH is provable from ZFC, though either can be added without creating contradiction.

Question 4

Gödel's incompleteness theorems show that ZFC is inconsistent — it contains contradictions that mathematicians have not yet discovered.

• T. True
• F. False

Answer: False

This is a common misreading. Gödel's theorems say that *if* ZFC is consistent, it cannot prove its own consistency — and any consistent system powerful enough to express arithmetic contains true-but-unprovable statements. The theorems say nothing about whether ZFC *is* consistent; they say it cannot settle that question internally. The prevailing view among mathematicians is that ZFC is consistent (based on decades without contradiction, informal models like the cumulative hierarchy, and relative consistency proofs), but this confidence is informal — exactly as the Second Incompleteness Theorem predicts.

Question 5

What is the significance of Gödel's Second Incompleteness Theorem for ZFC as a foundation for mathematics? Does it mean we should distrust ZFC?

Model answer: The Second Incompleteness Theorem means ZFC cannot prove its own consistency — any proof of 'ZFC is consistent' would require a stronger system. This sets a logical ceiling on self-justification: no sufficiently powerful formal system can fully validate itself. This does not mean ZFC should be distrusted. Confidence in ZFC's consistency rests on informal evidence: the cumulative hierarchy of sets provides an intuitive model, decades of mathematical work have produced no contradiction, and relative consistency proofs reduce 'ZFC is consistent' to 'this stronger system is consistent' — exchanging one unprovable assumption for another. ZFC is not broken; it has a precisely characterized horizon beyond which formal justification cannot reach.

The theorem reveals a general truth about formal systems, not a specific defect in ZFC. Any replacement for ZFC would face the same ceiling. What Gödel showed is that mathematics cannot be fully self-grounding — some trust in the foundation must be extra-formal. This motivates the study of large cardinal axioms and forcing: instead of seeking absolute consistency proofs (impossible by the Second Theorem), mathematicians map the consistency-strength landscape, establishing which axioms are stronger than others and which questions each level can settle.