Sublattices of the Recursively Enumerable Degrees
From MaRDI portal
Publication:5570929
DOI10.1002/MALQ.19710170131zbMATH Open0181.01301OpenAlexW2075451552WikidataQ56430705 ScholiaQ56430705MaRDI QIDQ5570929FDOQ5570929
Authors: S. K. Thomason 
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170131
Cited In (17)
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Embedding finite lattices into the Σ20 enumeration degrees
- Lattice embeddings into the recursively enumerable degrees. II
- Generalized nonsplitting in the recursively enumerable degrees
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- Recursively enumerable sets and degrees
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Branching Degrees above low Degrees
- Lattice nonembeddings and intervals of the recursively enumerable degrees
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees
- On the strongly bounded Turing degrees of the computably enumerable sets
- On minimal pairs of enumeration degrees
- The decision problem for recursively enumerable degrees
This page was built for publication: Sublattices of the Recursively Enumerable Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5570929)
