Pages that link to "Item:Q4304112"
From MaRDI portal
The following pages link to A Uniform Approach to Fundamental Sequences and Hierarchies (Q4304112):
Displayed 31 items.
- Streamlined subrecursive degree theory (Q408165) (← links)
- Phase transitions of iterated Higman-style well-partial-orderings (Q661281) (← links)
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths (Q673975) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Classifying the phase transition threshold for Ackermannian functions (Q1012327) (← links)
- Sometimes slow growing is fast growing (Q1377604) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Ackermannian Goodstein sequences of intermediate growth (Q2106602) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results (Q2566073) (← links)
- Some interesting connections between the slow growing hierarchy and the Ackermann function (Q2747706) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- From Subsystems of Analysis to Subsystems of Set Theory (Q3305559) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
- Classifying the Provably Total Functions of PA (Q3430936) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- On a question of Andreas Weiermann (Q3619872) (← links)
- Complexity of Gödel’s T in λ-Formulation (Q3637208) (← links)
- Variations on a theme by Weiermann (Q4227873) (← links)
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's <i>T</i>: a case study (Q4254685) (← links)
- How to characterize provably total functions by local predicativity (Q4879900) (← links)
- Accessible Recursive Functions (Q4940736) (← links)
- GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION (Q4959664) (← links)
- On the Performance of Axiom Systems (Q5055280) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- Iterated Inductive Definitions Revisited (Q5214787) (← links)
- Normal forms for elementary patterns (Q5388725) (← links)
- The hierarchy of terminating recursive programs over N (Q6064287) (← links)
- Functorial Fast-Growing Hierarchies (Q6148467) (← links)
- A WALK WITH GOODSTEIN (Q6204143) (← links)