Pages that link to "Item:Q1919522"
From MaRDI portal
The following pages link to Transfinite induction within Peano arithmetic (Q1919522):
Displaying 18 items.
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
- Slow reflection (Q2407272) (← links)
- Weak and strong versions of effective transfinite recursion (Q2683778) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
- Variations on a theme by Weiermann (Q4227873) (← links)
- A Model-Theoretic Approach to Ordinal Analysis (Q4338039) (← links)
- Proof Theoretic Analysis by Iterated Reflection (Q4637223) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- PREDICATIVE COLLAPSING PRINCIPLES (Q5107241) (← links)
- Set-theoretic reflection is equivalent to induction over well-founded classes (Q5117344) (← links)
- What is effective transfinite recursion in reverse mathematics? (Q6047666) (← links)
