The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program

@article{Zach2004ThePO,
  title={The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program},
  author={Richard Zach},
  journal={Synthese},
  year={2004},
  volume={137},
  pages={211-259}
}
  • R. Zach
  • Published 24 February 2001
  • Mathematics, Computer Science
  • Synthese
After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and… 
Hilbert's Proof Theory
  • W. Sieg
  • Computer Science, Mathematics
    Logic from Russell to Church
  • 2009
TLDR
The journey along that path begins with an analysis of the modern axiomatic method, proceeds to a discussion of the role of consistency proofs, and ends with a sketch of the content of Hilbert and Bernays’ magisterial work Grundlagen der Mathematik.
The constructive Hilbert program and the limits of Martin-lof type theory
Hilbert’s program is one of the truly magnificent projects in the philosophy of mathematics. To carry out this program he founded a new discipline of mathematics, called “Beweistheorie”, which was to
In the Shadow of Incompleteness: Hilbert and Gentzen
  • W. Sieg
  • Philosophy, Computer Science
    Epistemology versus Ontology
  • 2012
TLDR
A nuanced and deepened understanding is aims for how Godel’s results effected a transformation of proof theory between 1930 and 1934, and there is deepened concern for interpreting intuitionist arithmetic (and thus understanding classical arithmetic) from a more strictly constructive perspective.
Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's
Hilbert's program then and now
Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,”
2 9 A ug 2 00 5 Hilbert ’ s Program Then and Now
Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,”
2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
TLDR
The main focus of this tutorial is to present an new approach of a more algebraic flavour to proof-theoretic analysis based on the notion of graded provability algebra, that is, the Lindenbaum boolean algebra of a formal theory enriched by additional operators which allow the structure to capture proof- theoretic information.
NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
TLDR
A historical account of the idea of nominalistic ordinals in the context of the Hilbert Programme as well as Gentzen and Bernays’ finitary interpretation of transfinite induction are presented.
Kurt Gödel, paper on the incompleteness theorems (1931)
Publisher Summary This chapter describes Kurt Godel's paper on the incompleteness theorems. Godel's incompleteness results are two of the most fundamental and important contributions to logic and the
The quantum strategy of completeness: On the self-foundation of mathematics
Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 127 REFERENCES
Hilbert's programs: 1917-1922
  • W. Sieg
  • Mathematics, Computer Science
    Bull. Symb. Log.
  • 1999
TLDR
The connection of Hilbert's considerations to issues in the foundations of mathematics during the second half of the 19th century is sketched, the work that laid the basis of modern mathematical logic is described, and the first steps in the new subject of proof theory are analyzed.
Between Russell and Hilbert: Behmann on the foundations of mathematics
  • P. Mancosu
  • Mathematics, Computer Science
    Bull. Symb. Log.
  • 1999
TLDR
A detailed presentation of the approach to the foundations of mathematics found in Behmann’s doctoral dissertation of 1918, Die Antinomie der transfiniten Zahl und ihre Auflösung durch die Theorie von Russell und Whitehead is given.
Gentzen-type systems and Hilbert's epsilon substitution method. I
Publisher Summary This chapter discusses the Gentzen-type systems and Hilbert's epsilon substitution method. The substitution method was suggested by Hilbert within the framework of his program for
Completeness before Post: Bernays, Hilbert, and the development of propositional logic
  • R. Zach
  • Mathematics, Computer Science
    Bull. Symb. Log.
  • 1999
TLDR
It is argued that truth-value semantics, syntactic (“Post-”) and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged.
From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931
The fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for the first time. Modern logic, heralded
Grigori Mints Thoralf Skolem and the Epsilon Substitution Method for Predicate Logic *
Skolem’s contributions to mathematical logic are fundamental and far-reaching. A good survey by Hao Wang (1970) is presented in Fenstad’s collection of Skolem’s works (1970). Even Skolemization, i.e.
REMARKS ON FINITISM
The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic, PRA; and in 1981, in
Principia Mathematica
THIS work contains some thousands of propositions, each, with its proof, expressed in a shorthand so concise that if they were all expanded into ordinary language, the room taken up would be ten
316 Notre Dame Journal of Formal Logic
Katz 's new clothes Katz's new view about language and linguistics comes in two parts: platonism and nonreductionism. Those of us who have been skeptical about the empirical basis for claims that
Between Vienna and Berlin: The Immediate Reception of Godel's Incompleteness Theorems
What were the earliest reactions to Godel's incompleteness theorems? After a brief summary of previous work in this area I analyse, by means of unpublished archival material, the first reactions in
...
1
2
3
4
5
...