Pages that link to "Item:Q1193596"
From MaRDI portal
The following pages link to Ordinal complexity of recursive definitions (Q1193596):
Displaying 5 items.
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
