Elementary descent recursion and proof theory

DOI10.1016/0168-0072(94)00003-LMaRDI QIDQ1344279zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

functionalstransfinite inductiontransfinite recursionHardy hierarchyGrzegorczyk hierarchyordinal estimates for provably recursive functionswell- orderings

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15)

Recommendations

• Recursion and proofs
• A proof-theoretic account of primitive recursion and primitive iteration
• scientific article; zbMATH DE number 941039
• Recursion theory in a lower semilattice
• Recursion, induction and well-founded orders
• Towards an algebraic theory of recursion
• Recursion theory. Computational aspects of definability
• scientific article; zbMATH DE number 2222029
• scientific article; zbMATH DE number 3857082
• Induction rules, reflection principles, and provably recursive functions

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 3327279 (Why is no real title available?)
• Finite investigations of transfinite derivations
• On n-quantifier induction
• Proof theory

Cited in

(23)

• Variations on a theme by Weiermann
• Long finite sequences
• Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
• Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal
• How to characterize provably total functions by local predicativity
• Phase transitions for Gödel incompleteness
• Recursive proof composition from accumulation schemes
• Sub-computabilities
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
• Mining the surface: witnessing the low complexity theorems of arithmetic
• How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
• An application of graphical enumeration to PA *
• Classifying the Provably Total Functions of PA
• scientific article; zbMATH DE number 941039 (Why is no real title available?)
• An ordinal analysis for theories of self-referential truth
• Rudimentary relations and primitive recursion: A toolbox
• Reverse mathematics and well-ordering principles: a pilot study
• Subsystems of true arithmetic and hierarchies of functions
• Witnessing flows in arithmetic
• Some results on cut-elimination, provable well-orderings, induction and reflection
• A note on fragments of uniform reflection in second order arithmetic
• Update procedures and the 1-consistency of arithmetic
• A mathematical commitment without computational strength

This page was built for publication: Elementary descent recursion and proof theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344279)