Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
From MaRDI portal
Publication:2647392
DOI10.1007/BF01564760zbMath0028.10201WikidataQ55923686 ScholiaQ55923686MaRDI QIDQ2647392
No author found.
Publication date: 1943
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/160122
Related Items (41)
1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Dialogues and Proofs; Yankov’s Contribution to Proof Theory ⋮ Proof Theory in Philosophy of Mathematics ⋮ A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ On the Performance of Axiom Systems ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Epistemic arithmetic is a conservative extension of intuitionistic arithmetic ⋮ Slow reflection ⋮ The machinery of consistency proofs ⋮ Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency ⋮ Nested recursion ⋮ Beweistheoretische Abgrenzung von Teilsystemen der Analysis ⋮ Gentzen reduction revisited ⋮ Mathematical significance of consistency proofs ⋮ Proof-theoretical analysis: Weak systems of functions and classes ⋮ Type-theoretic approaches to ordinals ⋮ The Mathematical Development of Set Theory from Cantor to Cohen ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM ⋮ Ackermann and Goodstein go functorial ⋮ From Subsystems of Analysis to Subsystems of Set Theory ⋮ Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Type-theoretic interpretation of iterated, strictly positive inductive definitions ⋮ Consistency, models, and soundness ⋮ Levy and set theory ⋮ Proof theory and ordinal analysis ⋮ Notation systems for infinitary derivations ⋮ Consistency of Heyting arithmetic in natural deduction ⋮ Iterated Inductive Definitions Revisited ⋮ The middle ground-ancestral logic ⋮ Provable wellorderings of formal theories for transfinitely iterated inductive definitions ⋮ Exact estimates of the provability of transfinite induction in the initial segments of arithmetic ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection ⋮ ``Gaisi Takeuti's finitist standpoint and its mathematical embodiment ⋮ Gödel, Gentzen, Goodstein: the magic sound of a G-string ⋮ … and so on: Schütte on Naming Ordinals ⋮ An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models ⋮ On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising ⋮ Neo-Logicism and Its Logic ⋮ Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
This page was built for publication: Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
