Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
From MaRDI portal
Publication:2649136
DOI10.1007/BF01342849zbMath0042.00803MaRDI QIDQ2649136
Publication date: 1951
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/160227
Related Items
Well-Ordering Principles in Proof Theory and Reverse Mathematics, Zur Widerspruchsfreiheit einer typenfreien Logik, Ein System des Verknüpfenden Schliessens, On the computational complexity of cut-reduction, Proof-theoretical analysis: Weak systems of functions and classes, Pa-Beweisbare ∀∃-Formeln, Continuous normalization for the lambda-calculus and Gödel's T, Semantic values for natural deduction derivations, Notation systems for infinitary derivations, Ordinal analysis by transformations, Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent, Consistency proof without transfinite induction for a formal system for turing machines, \(\supset\)E is admissible in ``true relevant arithmetic, Completeness of the primitive recursive \(\omega \)-rule, Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas, Invertible infinitary calculus without loop rules for restricted FTL, “Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays, Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension, An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models, Lorenzen Between Gentzen and Schütte
