KnowraGödel's incompleteness theoremsLinked fromLinked fromThe 58 pages that link to Gödel's incompleteness theorems, each with the reason it gives.All 58Broader topic 9Related 36Narrower topic 4Compared with 9David HilbertCompared with: They sharply limited the consistency goals Hilbert had set for formal mathematics.John von NeumannCompared with: They revealed limits in the formalist ambitions that shaped von Neumann’s early mathematical work.Proof theoryCompared with: They sharply constrained the consistency ambitions that motivated early proof theory.SoundnessCompared with: They concern limits of provability, not failures of soundness.EntscheidungsproblemCompared with: They concern limits of formal proof, while the Entscheidungsproblem concerns algorithmic decision of validity.Gödel's completeness theoremCompared with: Despite the shared name, incompleteness concerns particular theories, not first-order logic's proof calculus.CompletenessCompared with: They concern truth in intended arithmetic, not completeness for all models.Kleene's recursion theoremCompared with: Their self-reference is used to establish unprovability, not to construct behaviorally fixed-point programs.S-m-n theoremCompared with: Both use effective coding, but incompleteness concerns formal provability rather than program specialization.