The following pages link to Nested recursion (Q1131248):
Displaying 10 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)
- A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION (Q4628680) (← links)
