Pages that link to "Item:Q2277451"
From MaRDI portal
The following pages link to Notation systems for infinitary derivations (Q2277451):
Displaying 27 items.
- Intuitionistic fixed point theories over set theories (Q494642) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- The consistency of arithmetic (Q666895) (← links)
- Completeness of the primitive recursive \(\omega \)-rule (Q781515) (← links)
- Finite notations for infinite terms (Q1295405) (← links)
- Proof theory of reflection (Q1332853) (← links)
- A termination proof for epsilon substitution using partial derivations (Q1401363) (← links)
- Reduction of finite and infinite derivations (Q1577482) (← links)
- A note on iterated consistency and infinite proofs (Q1734260) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Slow reflection (Q2407272) (← links)
- Cut elimination for a simple formulation of epsilon calculus (Q2478554) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- Classifying the Provably Total Functions of PA (Q3430936) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- How to characterize provably total functions by local predicativity (Q4879900) (← links)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC (Q5044314) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 (Q5421032) (← links)
- AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS (Q6123580) (← links)
