STRUCTURED COURSE · 14 LESSONS · 4 PARTS

The Limits of Proof

Distinguish statements, inference, validity and incompleteness.

No completed checks on this device yet.

Begin Statement →

First three lessons open. Later lessons require membership. Reading a lesson is not the same as completing its check.

Starting level and learning objectives

Start with Statement. Its explanation and recognition check are included in the opening part.

Begin with the first authored foundations. If you enter later, each lesson names its necessary preparation and offers authored recovery.

  • In 1931, Gödel proved that any formal system powerful enough to describe ordinary arithmetic contains true statements that the system itself cannot prove — a limit built into the very structure of formal reasoning, not a temporary gap waiting to be closed.
  • You can evaluate validity independently of whether a conclusion happens to be true.
  • You can use explanatory inference while retaining the possibility of revision.
  • You can test whether a formal result has been transferred with its assumptions intact.

Your route through the course

Open a part to see its purpose and lessons. Begin with the recommended step above; use the curriculum to find your place.

01Arguments and formal limits

Distinguish statements, inference, validity and incompleteness.

  1. StatementOpen lesson
  2. ValidityOpen lesson
  3. InferenceOpen lesson
  4. FallacyMember lesson
  5. InductionMember lesson
  6. ParadoxMember lesson
  7. Modal logicMember lesson
  8. IncompletenessMember lesson
02Quantifiers and countermodels

Make the scope of a claim explicit.

  1. Quantifier order changes the claimMember lesson
  2. Test validity by trying to break the inferenceMember lesson
03Evidence and revision

Reason when conclusions are supported rather than guaranteed.

  1. Evidence must be read against prior frequencyMember lesson
  2. The best explanation is still an inferenceMember lesson
04What systems can establish

Separate provability, truth, decidability and the assumptions behind them.

  1. Complete in which sense?Member lesson
  2. Separate a limit theorem from a sweeping sloganMember lesson
About the course and the three open introductions

Reach Gödel’s incompleteness theorem: the proven fact that any sufficiently powerful, consistent formal system contains true statements it cannot prove.

Statement

“Close the door” cannot be true or false; it is an instruction. “The door is closed” can be one or the other. Logic only operates on sentences of this second kind.

This sounds trivial until it is skipped: arguments quietly go wrong when a command or a value judgment is treated as if it were a plain factual claim that could simply be true or false.

Validity

“All cats can fly. Felix is a cat. So Felix can fly” is a valid argument: the conclusion follows necessarily from the premises. It is also unsound, because the first premise is false.

Keeping these apart matters. An argument can be perfectly valid and still worthless if it starts from a false premise, and a true conclusion can still come from an invalid argument by accident.

Inference

“If it rains, the ground gets wet. It is raining. So the ground is wet” follows this exact pattern, called modus ponens. The pattern is what guarantees the move, not the specific content about rain.

The same abstract pattern works for any P and Q whatsoever. Recognizing the underlying rule, separate from the particular sentences filling it, is what lets someone check an argument's structure quickly.