Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik

DOI10.1007/BF01972460zbMath0158.00705OpenAlexW2087489880MaRDI QIDQ5540436

Kurt Schütte

Publication date: 1965

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137771

zbMATH Keywords

mathematical logic

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem, Well-Ordering Principles in Proof Theory and Reverse Mathematics, Error and Predicativity, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, Derivatives of normal functions in reverse mathematics, Well-Partial Orderings and their Maximal Order Types, Proof Theoretic Analysis by Iterated Reflection, The Operational Perspective: Three Routes, From Subsystems of Analysis to Subsystems of Set Theory, Generalizations of the one-dimensional version of the Kruskal-Friedman theorems, \(\Pi_1^1\)-comprehension as a well-ordering principle, Proof theory and ordinal analysis, Eine Funktionalinterpretation der prädikativen Analysis, Unfolding Schematic Systems, Predicativity and Feferman, The implicit commitment of arithmetical theories and its semantic core, Predicativity and constructive mathematics, Reminiscences of Kurt Schütte, Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$, The Limits of Predicativity Revisited, THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

Cites Work

• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie