The following pages link to Nested recursion (Q1131248):
Displaying 21 items.
- Exact bounds on epsilon processes (Q535160) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- The first example of a recursive function which is not primitive recursive (Q1135847) (← links)
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Herbrand analyses (Q2641297) (← links)
- Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem (Q2963957) (← links)
- UNFOLDING FINITIST ARITHMETIC (Q3066785) (← links)
- Classifications of Recursive Functions by Means of Hierarchies (Q3291527) (← links)
- Pa-Beweisbare ∀∃-Formeln (Q3338236) (← links)
- Undecidable complexity statements in -arithmetic (Q3480020) (← links)
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising (Q3949042) (← links)
- Reducing Ordinal Recursion (Q4077998) (← links)
- A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION (Q4628680) (← links)
- Minimal readability of intuitionistic arithmetic and elementary analysis (Q4876321) (← links)
- Unfolding Schematic Systems (Q5214786) (← links)
- Functionals defined by transfinite recursion (Q5343335) (← links)
- A classification of the ordinal recursive functions (Q5635436) (← links)
- Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie (Q5672874) (← links)
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy (Q5676207) (← links)
- On <i>n</i>-quantifier induction (Q5680103) (← links)
- Long finite sequences (Q5940305) (← links)
