Elementary descent recursion and proof theory
From MaRDI portal
Publication:1344279
DOI10.1016/0168-0072(94)00003-LzbMath0821.03027OpenAlexW1998796136MaRDI QIDQ1344279
Michael Sheard, Harvey M. Friedman
Publication date: 9 February 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)00003-l
functionalstransfinite inductiontransfinite recursionHardy hierarchyGrzegorczyk hierarchyordinal estimates for provably recursive functionswell- orderings
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03) Recursive ordinals and ordinal notations (03F15)
Related Items
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study, A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal, Unnamed Item, Mining the surface: witnessing the low complexity theorems of arithmetic, How to characterize provably total functions by local predicativity, Long finite sequences, An ordinal analysis for theories of self-referential truth, Phase transitions for Gödel incompleteness, Sub-computabilities, An application of graphical enumeration to PA *, Reverse mathematics and well-ordering principles: a pilot study, Some results on cut-elimination, provable well-orderings, induction and reflection, Classifying the Provably Total Functions of PA, Variations on a theme by Weiermann
Cites Work
