Embeddings of \(N_5\) and the contiguous degrees

DOI10.1016/S0168-0072(01)00028-8zbMath1003.03038MaRDI QIDQ5956887

Peter A. Fejer, Ambos-Spies, Klaus

Publication date: 30 January 2003

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

embedding; computably enumerable degree; contiguous degrees; nonmodular lattice; weak truth table degree

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Computational processes, observers and Turing incompleteness, TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Array nonrecursive degrees and lattice embeddings of the diamond
• Wtt-degrees and T-degrees of r.e. sets
• Degree theoretical splitting properties of recursively enumerable sets
• Decomposition of Recursively Enumerable Degrees
• Branching Degrees above low Degrees
• The weak truth table degrees of recursively enumerable sets
• Contiguity and distributivity in the enumerable Turing degrees
• Maximal contiguous degrees
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Degrees in Which the Recursive Sets are Uniformly Recursive