Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
From MaRDI portal
Publication:2649136
Cited in
(21)- Ordinal analysis by transformations
- An infinitary system for the least fixed-point logic restricted to finite models
- Continuous normalization for the lambda-calculus and Gödel's T
- Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
- Lorenzen Between Gentzen and Schütte
- Invertible infinitary calculus without loop rules for restricted FTL
- Zur Widerspruchsfreiheit einer typenfreien Logik
- Completeness of the primitive recursive \(\omega \)-rule
- “Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays
- Theoretical computer science: computability, decidability and logic
- Pa-Beweisbare ∀∃-Formeln
- Notation systems for infinitary derivations
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Consistency proof without transfinite induction for a formal system for turing machines
- Semantic values for natural deduction derivations
- Ein System des Verknüpfenden Schliessens
- Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
- \(\supset\)E is admissible in ``true relevant arithmetic
- On the computational complexity of cut-reduction
- Proof-theoretical analysis: Weak systems of functions and classes
This page was built for publication: Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2649136)
