Degrees of relative provability
From MaRDI portal
Publication:691125
DOI10.1215/00294527-1722710zbMath1269.03043MaRDI QIDQ691125
Publication date: 29 November 2012
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1352383227
degree structure; provability strength; relative provability order of recursive algorithms; totality of recursive functions
03D20: Recursive functions and relations, subrecursive hierarchies
03F03: Proof theory in general (including proof-theoretic semantics)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Honest elementary degrees and degrees of relative provability without the cupping property, Unprovability and proving unprovability, On the structure of the degrees of relative provability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A jump operator on honest subrecursive degrees
- Elementary Embeddings and Algebra
- Extension of an effectively generated class of functions by enumeration
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- Accessible Independence Results for Peano Arithmetic