scientific article; zbMATH DE number 841089

MaRDI QIDQ4863245zbMATH OpenFDO

Authors Manuel Lerman

Publication date 4 February 1996

zbMATH Keywords

embeddingpartially ordered structuresrecursively enumerable degreessurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 3939344
• Lattice embeddings into the recursively enumerable degrees. II
• Lattice embeddings into the recursively enumerable degrees
• Embeddings into the Turing degrees
• Lattice nonembeddings and initial segments of the recursively enumerable degrees

Cited in

(15)

• Partial degrees and \(r\)-degrees
• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
• Turing computability: structural theory
• Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
• Diamond embeddings into the enumeration degrees
• scientific article; zbMATH DE number 3875249 (Why is no real title available?)
• Embeddings into the Turing degrees
• scientific article; zbMATH DE number 3939344 (Why is no real title available?)
• Lattice embeddings into the recursively enumerable degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• scientific article; zbMATH DE number 1531929 (Why is no real title available?)
• Effective embeddings into strong degree structures
• scientific article; zbMATH DE number 841095 (Why is no real title available?)
• scientific article; zbMATH DE number 1390016 (Why is no real title available?)
• Embeddings of N₅ and the contiguous degrees

This page was built for publication:

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