HackerPapers

arXiv:2102.08346math.LO

The Collapse of the Hilbert Program: A Variation on the Gödelian Theme

Saul A. Kripke

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The Hilbert program was actually a specific approach for proving consistency. Quantifiers were supposed to be replaced by $ε$-terms. $ε{x}A(x)$ was supposed to denote a witness to $\exists{x}A(x)$, arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system $S$, each $ε$-term can be replaced by a numeral, making each line provable and true. This implies that $S$ must not only be consistent, but also 1-consistent ($Σ_{1}^{0}$-correct). Here we show that if the result is supposed to be provable within $S$, a statement about all $Π_{2}^{0}$ statements that subsumes itself within its own scope must be provable, yielding a contradiction. The result resembles Gödel's but arises naturally out of the Hilbert program itself.

arXiv comments
Journal reference
DOI
Subjects
math.LOLogic

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Feb 2024 to Feb 2024.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Another philosopher about Gödel: The Collapse of the Hilbert Program: A Variation on the Gödelian Theme* Saul A. Kripke https://arxiv.org/abs/2102.08346

      hackandthinkView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.