Pages that link to "Item:Q5676207"
From MaRDI portal
The following pages link to Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy (Q5676207):
Displaying 21 items.
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- Some interesting connections between the slow growing hierarchy and the Ackermann function (Q2747706) (← links)
- Slow growing versus fast growing (Q3478403) (← links)
- The slow-growing and the Graegorczyk hierarchies (Q3682477) (← links)
- Majorizing provably recursive functions in fragments of PA (Q3720596) (← links)
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising (Q3949042) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies (Q4305315) (← links)
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods (Q4750638) (← links)
- Minimal readability of intuitionistic arithmetic and elementary analysis (Q4876321) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- (Q5101339) (← links)
- On mathematical instrumentalism (Q5718688) (← links)
- Long finite sequences (Q5940305) (← links)
- Functorial Fast-Growing Hierarchies (Q6148467) (← links)
