Γ0 May Be Minimal Subrecursively Inaccessible

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200108)47:3<397::AID-MALQ397>3.0.CO;2-Y" /><397::AID-MALQ397>3.0.CO;2-Y 10.1002/1521-3870(200108)47:3<397::AID-MALQ397>3.0.CO;2-YzbMath0990.03044OpenAlexW2022346644MaRDI QIDQ2743650

Andreas Weiermann

Publication date: 6 November 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200108)47:3<397::aid-malq397>3.0.co;2-y

zbMATH Keywords

proof theoryhierarchiesfundamental sequencesclassification of recursive functionssubrecursively inaccessible ordinal

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Hierarchies of computability and definability (03D55)

This page was built for publication: Γ0 May Be Minimal Subrecursively Inaccessible