Bounded reducibility for computable numberings

DOI10.1007/978-3-030-22996-2_9MaRDI QIDQ2179352zbMATHOpenAlexFDO

Authors S. S. Ospichev, Nikolay Bazhenov, Mustafa Manat

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-22996-2_9

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Rogers semilattices of limitwise monotonic numberings
• Khutoretskii's theorem for generalized computable families
• Reductions between types of numberings
• Publication:3033754
• Theories of Rogers semilattices of analytical numberings

Cited in

(13)

• On \(p\)-reducibility of computable numerations
• scientific article; zbMATH DE number 2007861 (Why is no real title available?)
• On notions of computability-theoretic reduction between Π21 principles
• scientific article; zbMATH DE number 4130363 (Why is no real title available?)
• scientific article; zbMATH DE number 4132145 (Why is no real title available?)
• Computable fields and the bounded Turing reduction
• scientific article; zbMATH DE number 1747699 (Why is no real title available?)
• Local structure of Rogers semilattices of Σn 0-computable numberings
• Khutoretskii's theorem for generalized computable families
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• Reductions between types of numberings
• Rogers semilattices of limitwise monotonic numberings
• Computability and models. Perspectives east and west

This page was built for publication: Bounded reducibility for computable numberings

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