Sublattices of the Recursively Enumerable Degrees
From MaRDI portal
Publication:5570929
DOI10.1002/malq.19710170131zbMath0181.01301OpenAlexW2075451552WikidataQ56430705 ScholiaQ56430705MaRDI QIDQ5570929
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
Related Items
Embedding finite lattices into the Σ20 enumeration degrees, A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Cupping and noncapping in the r.e. weak truth table and turing degrees, Not every finite lattice is embeddable in the recursively enumerable degrees, Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees, On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets, Generalized nonsplitting in the recursively enumerable degrees, Branching Degrees above low Degrees, The decision problem for recursively enumerable degrees, A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element, Lattice nonembeddings and intervals of the recursively enumerable degrees, ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS, Recursively enumerable sets and degrees, On minimal pairs of enumeration degrees, Lattice embeddings into the recursively enumerable degrees. II, The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
