Embeddings in the Strong Reducibilities Between 1 and npm

DOI10.1002/MALQ.19970430411zbMATH Open0883.03026OpenAlexW2055728706MaRDI QIDQ4366134FDOQ4366134

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)

Cites Work

• Title not available (Why is that?)
• Initial Segments of Many-One Degrees
• Initial segments of one-one degrees

Cited In (1)

• Embedding of countable orders in Turing degrees

   Recommendations

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

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)