Bounded reducibility for computable numberings

DOI10.1007/978-3-030-22996-2_9zbMATH Open1434.03111OpenAlexW2955275363MaRDI QIDQ2179352FDOQ2179352

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

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

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cited In (13)

• Title not available (Why is that?)
• Computable fields and the bounded Turing reduction
• Rogers semilattices of limitwise monotonic numberings
• On notions of computability-theoretic reduction between Π21 principles
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• Reductions between types of numberings
• Title not available (Why is that?)
• Computability and models. Perspectives east and west
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local structure of Rogers semilattices of Σn 0-computable numberings
• On \(p\)-reducibility of computable numerations
• Khutoretskii's theorem for generalized computable families

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)