A Uniform Approach to Fundamental Sequences and Hierarchies
From MaRDI portal
Publication:4304112
DOI10.1002/malq.19940400212zbMath0812.03023MaRDI QIDQ4304112
Wilfried Buchholz, Andreas Weiermann, Adam Cichon
Publication date: 14 May 1995
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19940400212
norm; recursive functions; Hardy function; ordinal notation; fundamental sequences; number-theoretic function; Hardy hierarchies; Bachmann property; Kripke-Platek set theory with a recursive Mahlo ordinal
03D20: Recursive functions and relations, subrecursive hierarchies
03F15: Recursive ordinals and ordinal notations
03E10: Ordinal and cardinal numbers
Related Items
How to characterize provably total functions by local predicativity, Accessible Recursive Functions, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths, The Hydra battle and Cichon's principle, Classifying the phase transition threshold for Ackermannian functions, Sometimes slow growing is fast growing, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\), Ackermann's substitution method (remixed), Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, Some interesting connections between the slow growing hierarchy and the Ackermann function, Multiply-Recursive Upper Bounds with Higman’s Lemma, Partitioning 𝛼–large sets: Some lower bounds, Classifying the Provably Total Functions of PA, A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets, On a question of Andreas Weiermann, Complexity of Gödel’s T in λ-Formulation, Variations on a theme by Weiermann, How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
Cites Work
