Pages that link to "Item:Q5118047"
From MaRDI portal
The following pages link to Computable aspects of the Bachmann–Howard principle (Q5118047):
Displaying 14 items.
- Patterns of resemblance and Bachmann-Howard fixed points (Q2064043) (← links)
- Minimal bad sequences are necessary for a uniform Kruskal theorem (Q2125990) (← links)
- Derivatives of normal functions in reverse mathematics (Q2216034) (← links)
- Ackermann and Goodstein go functorial (Q2234350) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- From Kruskal’s theorem to Friedman’s gap condition (Q4988429) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- PREDICATIVE COLLAPSING PRINCIPLES (Q5107241) (← links)
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? (Q5148106) (← links)
- WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY (Q5159496) (← links)
- A categorical construction of Bachmann–Howard fixed points (Q5205443) (← links)
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077) (← links)
- A note on ordinal exponentiation and derivatives of normal functions (Q6096326) (← links)
- Bachmann-Howard derivatives (Q6103503) (← links)