Embeddings in the Strong Reducibilities Between 1 and npm

DOI10.1002/MALQ.19970430411MaRDI QIDQ4366134zbMATH OpenOpenAlexFDO

Authors Phil Watson

Publication date 7 January 1998

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19970430411

zbMATH Keywords

enumeration reducibilitystrong reducibilitiesr.e. Turing degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Strong enumeration reducibilities
• Effective embeddings into strong degree structures
• Strong Positive Reducibilities
• T-Degrees, Jump Classes, and Strong Reducibilities

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Initial Segments of Many-One Degrees
• Initial segments of one-one degrees

Cited in

(7)

• On some reducibility and existential interpretability of structures
• Strong Positive Reducibilities
• Irreducible, singular, and contiguous degrees
• Strong Reducibilities of Enumerations and Partial Enumerated Algebras
• Structures of some strong reducibilities
• Strong enumeration reducibilities
• Embedding of countable orders in Turing degrees

This page was built for publication: Embeddings in the Strong Reducibilities Between 1 and npm

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