Variations on a theme by Weiermann

DOI10.2307/2586719zbMath0919.03043OpenAlexW2127926649MaRDI QIDQ4227873

Toshiyasu Arai

Publication date: 19 August 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586719

zbMATH Keywords

cut-eliminationprovably recursive functionslocal predicativityslow growing hierarchiesfast growing hierarchiesanalysis of arithmetical systemshierarchy generating functionsimpredicative proof theorynorm bounding transfinite recursion

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20)

Related Items (3)

Sometimes slow growing is fast growing ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection

Cites Work

• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• Consistency proof via pointwise induction
• A slow growing analogue to Buchholz' proof
• Elementary descent recursion and proof theory
• Proof-theoretic analysis of termination proofs
• Transfinite induction within Peano arithmetic
• A Uniform Approach to Fundamental Sequences and Hierarchies

This page was built for publication: Variations on a theme by Weiermann