Pages that link to "Item:Q2649136"
From MaRDI portal
The following pages link to Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie (Q2649136):
Displayed 13 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Ordinal analysis by transformations (Q1006618) (← links)
- \(\supset\)E is admissible in ``true'' relevant arithmetic (Q1272826) (← links)
- Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas (Q1589838) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Semantic values for natural deduction derivations (Q2500822) (← links)
- Invertible infinitary calculus without loop rules for restricted FTL (Q2577594) (← links)
- Zur Widerspruchsfreiheit einer typenfreien Logik (Q2650840) (← links)
- Ein System des Verknüpfenden Schliessens (Q3233196) (← links)
- Pa-Beweisbare ∀∃-Formeln (Q3338236) (← links)
- Consistency proof without transfinite induction for a formal system for turing machines (Q4192056) (← links)