Degrees of total algorithms versus degrees of honest functions

DOI10.1007/978-3-642-30870-3_43zbMATH Open1358.03052OpenAlexW2203030842MaRDI QIDQ2904437FDOQ2904437

Authors: Lars Kristiansen 

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_43

Recommendations

• Streamlined subrecursive degree theory
• The structure of the honest polynomial m-degrees
• Degrees of relative provability
• scientific article; zbMATH DE number 1507242
• Degrees of unsolvability of continuous functions

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (4)

• Semi-honest subrecursive degrees and the collection rule in arithmetic
• Streamlined subrecursive degree theory
• The structure of the honest polynomial m-degrees
• Honest elementary degrees and degrees of relative provability without the cupping property

This page was built for publication: Degrees of total algorithms versus degrees of honest functions

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