Der erste Widerspruchsfreiheitsbeweis für die klassische Zahlentheorie

@article{Gentzen1974DerEW,
  title={Der erste Widerspruchsfreiheitsbeweis f{\"u}r die klassische Zahlentheorie},
  author={Gerhard Gentzen},
  journal={Archiv f{\"u}r mathematische Logik und Grundlagenforschung},
  year={1974},
  volume={16},
  pages={97-118}
}
  • G. Gentzen
  • Published 1 August 1974
  • Mathematics
  • Archiv für mathematische Logik und Grundlagenforschung
Gentzen’s Original Consistency Proof and the Bar Theorem
The story of Gentzen’s original consistency proof for first-order number theory [9], as told by Paul Bernays [1, 9], [11, Letter 69, pp. 76–79], is now familiar: Gentzen sent it off to Mathematische
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.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
TLDR
A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of the authors' computers, and that formal relation of “reality’, “representation”, and “language” modeled by (at least two) Turing machines is investigated.
Epsilon Numbers
  • T. Arai
  • Ordinal Analysis with an Introduction to Proof Theory
  • 2020
Lorenzen's Proof of Consistency for Elementary Number Theory
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
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
Well-Ordering Principles in Proof Theory and Reverse Mathematics
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman,
KURT GÖDEL’S FIRST STEPS IN LOGIC: FORMAL PROOFS IN ARITHMETIC AND SET THEORY THROUGH A SYSTEM OF NATURAL DEDUCTION
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
...
1
2
3
4
...

References

Formale Beweise und die Entscheidbarkeit
----------------------------------------------------Nutzungsbedingungen DigiZeitschriften e.V. gewährt ein nicht exklusives, nicht übertragbares, persönliches und beschränktes Recht auf Nutzung