Lattice nonembeddings and intervals of the recursively enumerable degrees

DOI10.1016/0168-0072(93)90220-8MaRDI QIDQ1802183zbMATH OpenOpenAlexFDO

Authors Peter A. Cholak, Rodney G. Downey

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)

Recommendations

• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Lattice embeddings into the recursively enumerable degrees
• Lattice embeddings into the recursively enumerable degrees. II
• scientific article; zbMATH DE number 4125387
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Lattice embeddings and array noncomputable degrees
• Array nonrecursive degrees and lattice embeddings of the diamond
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• On lattice embeddings of a lattice into its intervals

Cites work

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

Cited in

(8)

• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• scientific article; zbMATH DE number 4125387 (Why is no real title available?)
• Contiguity and distributivity in the enumerable Turing degrees
• Lattice embeddings into the recursively enumerable degrees
• Lattice embeddings and array noncomputable degrees
• scientific article; zbMATH DE number 1507242 (Why is no real title available?)
• A degree bound for the Graver basis of non-saturated lattices

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

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