Lattice nonembeddings and initial segments of the recursively enumerable degrees

DOI10.1016/0168-0072(90)90062-7zbMATH Open0723.03025OpenAlexW1980888823WikidataQ127957228 ScholiaQ127957228MaRDI QIDQ757358FDOQ757358

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Refinement of Lown and Highn for the R.E. Degrees
• The undecidability of the recursively enumerable degrees
• The density of the nonbranching degrees
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Bounding minimal pairs
• Lattice embeddings into the recursively enumerable degrees. II

Cited In (16)

• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• Nondiamond theorems for polynomial time reducibility
• Initial segments of the lattice of ideals of r.e. degrees
• Splitting theorems in recursion theory
• Degree theoretic definitions of the low₂ recursively enumerable sets
• 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_5\) and the contiguous degrees
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Maximal contiguous degrees
• A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
• Definability in the Recursively Enumerable Degrees
• Hierarchy of Computably Enumerable Degrees II

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)