Switch to: References

Add citations

You must login to add citations.
  1. Where is the Gödel-Point Hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive Ordinals.Anna Horská - 2013 - Cham, Switzerland: Springer.
    This book explains the first published consistency proof of PA. It contains the original Gentzen's proof, but it uses modern terminology and examples to illustrate the essential notions. The author comments on Gentzen's steps which are supplemented with exact calculations and parts of formal derivations. A notable aspect of the proof is the representation of ordinal numbers that was developed by Gentzen. This representation is analysed and connection to set-theoretical representation is found, namely an algorithm for translating Gentzen's notation into (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Epistemology Versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf.Peter Dybjer, Sten Lindström, Erik Palmgren & Göran Sundholm (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Kurt gödel’s first steps in logic: Formal proofs in arithmetic and set theory through a system of natural deduction.Jan von Plato - 2018 - Bulletin of Symbolic Logic 24 (3):319-335.
    What seem to be Kurt Gödel’s first notes on logic, an exercise notebook of 84 pages, contains formal proofs in higher-order arithmetic and set theory. The choice of these topics is clearly suggested by their inclusion in Hilbert and Ackermann’s logic book of 1928, the Grundzüge der theoretischen Logik. Such proofs are notoriously hard to construct within axiomatic logic. Gödel takes without further ado into use a linear system of natural deduction for the full language of higher-order logic, with formal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Intuitionistic Background of Gentzen's 1935 and 1936 Consistency Proofs and Their Philosophical Aspects.Yuta Takahashi - 2018 - Annals of the Japan Association for Philosophy of Science 27:1-26.
    Gentzen's three consistency proofs for elementary number theory have a common aim that originates from Hilbert's Program, namely, the aim to justify the application of classical reasoning to quantified propositions in elementary number theory. In addition to this common aim, Gentzen gave a “finitist” interpretation to every number-theoretic proposition with his 1935 and 1936 consistency proofs. In the present paper, we investigate the relationship of this interpretation with intuitionism in terms of the debate between the Hilbert School and the Brouwer (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A Philosophical Significance of Gentzen’s 1935 Consistency Proof for First-Order Arithmetic.Yuta Takahashi - 2016 - Kagaku Tetsugaku 49 (1):49-66.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Consistency of Heyting arithmetic in natural deduction.Annika Kanckos - 2010 - Mathematical Logic Quarterly 56 (6):611-624.
    A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordinals each derivation of falsity is assigned an ordinal less than ε 0, thus proving termination of the procedure.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Lorenzen's Proof of Consistency for Elementary Number Theory.Thierry Coquand & Stefan Neuwirth - 2020 - History and Philosophy of Logic 41 (3):281-290.
    We present a manuscript of Paul Lorenzen that provides a proof of consistency for elementary number theory as an application of the construction of the free countably complete pseudocomplemented semilattice over a preordered set. This manuscript rests in the Oskar-Becker-Nachlass at the Philosophisches Archiv of Universität Konstanz, file OB 5-3b-5. It has probably been written between March and May 1944. We also compare this proof to Gentzen's and Novikov's, and provide a translation of the manuscript.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Reinhard Kahle and Michael Rathjen : Gentzen’s Centenary. The Quest for Consistency.David Binder - 2018 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 49 (3):475-479.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Reading Gentzen's Three Consistency Proofs Uniformly.Ryota Akiyoshi & Yuta Takahashi - 2013 - Journal of the Japan Association for Philosophy of Science 41 (1):1-22.