Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Kripke on Gödel Incompleteness

Bibliographic Data

ID20143490
AuthorsDaniel Isaacson (Philosophy Faculty Oxford University Oxford UK, corresponding author)
Year2026
Volume92
Issue3
Publication date2026-06-01
Open AccessYes
TypeARTICLE
VenueTheoria (JOURNAL)
Journal identifiersISSN: 0040-5825 • E-ISSN: 1755-2567
PublisherWiley (PUBLISHER • GB)
DOI10.1111/theo.70089
OpenAlexW7161642442
LanguageEN
References cited11

This paper surveys six of Saul Kripke's highly creative ideas and results on Gödel incompleteness, from when he was an undergraduate to last publications. These include his extension of incompleteness from sentences to predicates, his model‐theoretic proof of incompleteness of arithmetic, his compelling analysis of incompleteness in terms of the heterological paradox rather than the liar paradox (cited by Gödel) for a heuristic account of incompleteness, his ingenious demonstration that Hilbert's programme bore within itself the seeds of its collapse independently of Gödel incompleteness, his revisionist point that there was incompleteness in mathematics well before the Paris‐Harrington Theorem, and his demonstration, contrary to the common view, that direct self‐reference need not be contradictory and can be used to obtain a Gödel sentence containing a numeral for its own Gödel number. Kripke published the work surveyed here with the exception of his model‐theoretic proof of incompleteness, which he presented in a lecture in 1978. These ideas constitute mathematical results of great ingenuity and highly illuminating philosophical insights

Calculus (dental) · Extension (predicate logic) · Gödel's incompleteness theorems · Heuristic · Ingenuity · Numeral system · Point (geometry) · Semantics (computer science) · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis · Philosophy and Theoretical Science

  • An Introduction to Proof Theory

    Paolo Mancosu, Sergio Galvan et al.•Introduction to Proof Theory•2021

  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

    Open Access•Kurt Gödel•Monatshefte für Mathematik•1931

  • Mathematical Incompleteness Results in First-Order Peano Arithmetic

    Saul A Kripke•History and Philosophy of Logic•2022

Highly citedNo

Tools

Open DOIOpen Access
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae