Pages that link to "Item:Q1254248"
From MaRDI portal
The following pages link to Finite investigations of transfinite derivations (Q1254248):
Displaying 16 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- Completeness of the primitive recursive \(\omega \)-rule (Q781515) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Finite notations for infinite terms (Q1295405) (← links)
- Elementary descent recursion and proof theory (Q1344279) (← links)
- A termination proof for epsilon substitution using partial derivations (Q1401363) (← links)
- Reduction of finite and infinite derivations (Q1577482) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Cut elimination for a simple formulation of epsilon calculus (Q2478554) (← links)
- A term calculus for (co-)recursive definitions on streamlike data structures (Q2566066) (← links)
- Three faces of natural deduction (Q4610312) (← links)
- A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION (Q4628680) (← links)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC (Q5044314) (← links)
