Die Widerspruchsfreiheit der Stufenlogik

@article{Gentzen1936DieWD,
  title={Die Widerspruchsfreiheit der Stufenlogik},
  author={G. Gentzen},
  journal={Mathematische Zeitschrift},
  year={1936},
  volume={41},
  pages={357-366}
}
  • G. Gentzen
  • Published 1 December 1936
  • Mathematics
  • Mathematische Zeitschrift
Part I: A sketch of Gentzen’s life and work
Gerhard Gentzen died on August 4, 1945, in a prison in Prague. His fellow prisoners were professors of the local German university, and there are accounts of his last days and how he was, rendered
Logic Reduced To Bare (Proof-Theoretical) Bones
  • J. Peregrin
  • Mathematics, Computer Science
    J. Log. Lang. Inf.
  • 2015
TLDR
The aim of this paper is to investigate the relationship of the two approaches within a very general framework, to discuss the viability of erecting logic on such austere foundations, and to find out whether choosing one of the ways the authors are inevitably led to a specific logical system is chosen.
Gentzen's Logic
  • J. Plato
  • Computer Science, Mathematics
    Logic from Russell to Church
  • 2009
Second-order logic : ontological and epistemological problems
In this thesis I provide a survey over different approaches to second-order logic and its interpretation, and introduce a novel approach. Of special interest are the questions whether (a particular
A proof-irrelevant model of Martin-Löf's logical framework
TLDR
The proof-irrelevant model defined in Smith (1988) is extended to the whole of Martin-Löf's logical framework, and it is useful to obtain an elementary proof of consistency and to prove the independence of Peano's fourth axiom.
Cumulative Higher-Order Logic as a Foundation for Set Theory
TLDR
It is shown that several axiomatic first-order set theories can be interpreted in K∞ α, for suitable α, and a semantic completeness theorem for K ∞ α is proved by the method of reduction trees.
Cumulative Higher-Order Logic as a Foundation for Set Theory
The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness
On the meaning of logical rules I : Syntax versus semantics
« Oui c’est imbecile ce que je dis ! Seulement je ne sais pas comment concilier tout ca. Il est sur que je ne me sens libre que parce que j’ai fait mes classes et que je ne sors de la fugue que parce
...
1
2
...