Every ^0_2-set is natural, up to Turing equivalence

DOI10.1007/978-3-642-13962-8_43MaRDI QIDQ3576227zbMATH OpenOpenAlexFDO

Authors Dieter Spreen

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Recommendations

• scientific article; zbMATH DE number 1795232
• Turing degrees and the Ershov hierarchy
• scientific article; zbMATH DE number 28544
• The ^0_2 Turing degrees: automorphisms and definability
• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees

Cited in

(7)

• Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
• Non-cuppable enumeration degrees via finite injury
• The Settling Time Reducibility Ordering and  Formula Sets
• scientific article; zbMATH DE number 28544 (Why is no real title available?)
• scientific article; zbMATH DE number 1795232 (Why is no real title available?)
• Computation over algebraic structures and a classification of undecidable problems
• scientific article; zbMATH DE number 1404665 (Why is no real title available?)

This page was built for publication: Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence

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