Honest elementary degrees and degrees of relative provability without the cupping property

DOI10.1016/j.apal.2016.11.005zbMath1422.03086arXiv1604.06592OpenAlexW2962938955WikidataQ57948749 ScholiaQ57948749MaRDI QIDQ515565

Paul Shafer

Publication date: 16 March 2017

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

Full work available at URL: https://arxiv.org/abs/1604.06592

zbMATH Keywords

degrees of relative provabilityhonest elementary degreessub-recursive hierarchies

Mathematics Subject Classification ID

Logical aspects of lattices and related structures (03G10) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streamlined subrecursive degree theory
• Degrees of relative provability
• A jump operator on honest subrecursive degrees
• Augmented loop languages and classes of computable functions
• On the density of honest subrecursive classes
• Induction rules, reflection principles, and provably recursive functions
• Provability algebras and proof-theoretic ordinals. I
• Unprovability and proving unprovability
• On the structure of the degrees of relative provability
• Degrees of Total Algorithms versus Degrees of Honest Functions
• The honest subrecursive classes are a lattice
• On the induction schema for decidable predicates
• A Classification of the Recursive Functions
• Subrecursive degrees and fragments of Peano arithmetic

This page was built for publication: Honest elementary degrees and degrees of relative provability without the cupping property