Lattice embeddings into the recursively enumerable degrees

DOI10.2307/2274050zbMATH Open0633.03037OpenAlexW4240602437MaRDI QIDQ3770516FDOQ3770516

Authors: Klaus Ambos-Spies, Manuel Lerman 

Publication date: 1986

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274050

Recommendations

• Lattice embeddings into the recursively enumerable degrees. II
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Publication:4863245
• scientific article; zbMATH DE number 4125387
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• Publication:4934976
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Lattice embeddings and array noncomputable degrees
• Embedding finite lattices into the computably enumerable degrees -- a status survey

zbMATH Keywords

embeddingsfinite latticesrecursively enumerable degreesnonembeddability theoremuppersemilattice

Mathematics Subject Classification ID

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

Cited In (32)

• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• The distribution of the generic recursively enumerable degrees
• Lowness for isomorphism, countable ideals, and computable traceability
• Initial segments of the lattice of ideals of r.e. degrees
• Splitting theorems in recursion theory
• Lattice embeddings and array noncomputable degrees
• Lattice embeddings into the recursively enumerable degrees. II
• Title not available (Why is that?)
• Non-p-generic and strongly nonbranching degree
• 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
• The role of true finiteness in the admissible recursively enumerable degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• Turing computability: structural theory
• Embedding finite lattices into the ideals of computably enumerable turing degrees
• On the existence of a strong minimal pair
• Diamond embeddings into the enumeration degrees
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Title not available (Why is that?)
• The Lattice of Computably Enumerable Vector Spaces
• Structural theory of degrees of unsolvability: advances and open problems
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Degree Structures: Local and Global Investigations
• Embedding linkages on an integer lattice
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Non-p-generic and strongly nonbranching degree
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• On the embedding of distributive lattices into recursive polynomial degrees

This page was built for publication: Lattice embeddings into the recursively enumerable degrees

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