Lattice nonembeddings and intervals of the recursively enumerable degrees

DOI10.1016/0168-0072(93)90220-8zbMath0782.03020OpenAlexW2061274683MaRDI QIDQ1802183

Rodney G. Downey, Peter A. Cholak

Publication date: 10 March 1994

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

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90220-8

zbMATH Keywords

recursively enumerable degreescritical triplenonembedding

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (2)

Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Contiguity and distributivity in the enumerable Turing degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• On degrees of recursive unsolvability
• The density of infima in the recursively enumerable degrees
• The density of the nonbranching degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• There is no plus-capping degree
• The recursively enumerable degrees are dense
• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Pseudo Jump Operators. I: The R. E. Case
• Lattice embeddings into the recursively enumerable degrees
• Recursively enumerable sets and degrees
• Lattice embeddings into the recursively enumerable degrees. II
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Sublattices of the Recursively Enumerable Degrees
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Lattice nonembeddings and intervals of the recursively enumerable degrees