Lattice nonembeddings and initial segments of the recursively enumerable degrees

DOI10.1016/0168-0072(90)90062-7MaRDI QIDQ757358zbMATH OpenOpenAlexWikidataFDO

Authors Rodney G. Downey

Publication date 1990

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(90)90062-7

zbMATH Keywords

embeddingcritical tripleinitial segment of the upper semilattice of r.e. degrees

Mathematics Subject Classification ID

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

Recommendations

• Lattice nonembeddings and intervals of the recursively enumerable degrees
• scientific article; zbMATH DE number 749917
• Lattice embeddings into the recursively enumerable degrees. II
• scientific article; zbMATH DE number 3939344
• Lattice embeddings into the recursively enumerable degrees

Cites work

• scientific article; zbMATH DE number 4172958 (Why is no real title available?)
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 3916252 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3895050 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• A Refinement of Lown and Highn for the R.E. Degrees
• Bounding minimal pairs
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Lattice embeddings into the recursively enumerable degrees. II
• The density of the nonbranching degrees
• The undecidability of the recursively enumerable degrees

Cited in

(25)

• Hierarchy of Computably Enumerable Degrees II
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• Nondiamond theorems for polynomial time reducibility
• Splitting theorems in recursion theory
• Initial segments of the lattice of ideals of r.e. degrees
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Lattice embeddings into the recursively enumerable degrees. II
• A hierarchy of computably enumerable degrees
• Initial segments of the degrees of ceers
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• Embedding finite lattices into the ideals of computably enumerable turing degrees
• Embeddings of N₅ and the contiguous degrees
• scientific article; zbMATH DE number 4125387 (Why is no real title available?)
• scientific article; zbMATH DE number 733390 (Why is no real title available?)
• On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
• Initial segments of Δ_2n+1¹-degrees
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• scientific article; zbMATH DE number 3939344 (Why is no real title available?)
• scientific article; zbMATH DE number 841089 (Why is no real title available?)
• Maximal contiguous degrees
• Definability in the Recursively Enumerable Degrees
• Initial segments of the degrees of size \(\aleph _ 1\)

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

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