Degrees of relative provability

DOI10.1215/00294527-1722710zbMath1269.03043OpenAlexW2054442457MaRDI QIDQ691125

Mingzhong Cai

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

zbMATH Keywords

degree structureprovability strengthrelative provability order of recursive algorithmstotality of recursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Proof theory in general (including proof-theoretic semantics) (03F03) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (4)

Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ 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

This page was built for publication: Degrees of relative provability