A slow growing analogue to Buchholz' proof

DOI10.1016/0168-0072(91)90027-JzbMath0753.03022MaRDI QIDQ1182465

Toshiyasu Arai

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

provably total recursive functionsslow growing functionstheory with iterated inductive definitions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03) Complexity of proofs (03F20)

Related Items (7)

Proof-theoretic analysis of termination proofs ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Some interesting connections between the slow growing hierarchy and the Ackermann function ⋮ Accessible Recursive Functions ⋮ Induction and inductive definitions in fragments of second order arithmetic ⋮ Inductive definitions over a predicative arithmetic ⋮ Variations on a theme by Weiermann

Cites Work

• Unnamed Item
• Unnamed Item
• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• A new system of proof-theoretic ordinal functions

This page was built for publication: A slow growing analogue to Buchholz' proof