Pages that link to "Item:Q3011121"
From MaRDI portal
The following pages link to The Veblen functions for computability theorists (Q3011121):
Displaying 26 items.
- From hierarchies to well-foundedness (Q481873) (← links)
- Reverse mathematics and well-ordering principles: a pilot study (Q1032626) (← links)
- Derivatives of normal functions and \(\omega \)-models (Q1661685) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- Derivatives of normal functions in reverse mathematics (Q2216034) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Proof-theoretic strengths of the well-ordering principles (Q2309489) (← links)
- Big vee: the story of a function, an algorithm, and three mathematical worlds (Q2431008) (← links)
- The strength of Ramsey's theorem for coloring relatively large sets (Q2921021) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension (Q5013904) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- PREDICATIVE COLLAPSING PRINCIPLES (Q5107241) (← links)
- Computable aspects of the Bachmann–Howard principle (Q5118047) (← links)
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? (Q5148106) (← links)
- WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY (Q5159496) (← links)
- PRIORITY ARGUMENTS VIA TRUE STAGES (Q5177887) (← links)
- On the structure of the Wadge degrees of bqo-valued Borel functions (Q5380486) (← links)
- Reducing ω-model reflection to iterated syntactic reflection (Q6038474) (← links)
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077) (← links)
- A note on ordinal exponentiation and derivatives of normal functions (Q6096326) (← links)
- On the logical strength of the better quasi order with three elements (Q6135847) (← links)
- Functorial Fast-Growing Hierarchies (Q6148467) (← links)
- The Π21$\Pi ^1_2$ consequences of a theory (Q6176438) (← links)
- Iterated priority arguments in descriptive set theory (Q6636685) (← links)
- Higman's lemma is stronger for better quasi orders (Q6663926) (← links)
