Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees

DOI10.2307/2044964zbMath0534.03019OpenAlexW4237601987MaRDI QIDQ3317093

Carl G. jun. Jockusch, Jeanleah Mohrherr

Publication date: 1985

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

zbMATH Keywords

recursively enumerable setslattice embeddingstruth-table degreesreducibilitiesfour element Boolean algebra

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Lattice Embeddings in the Recursively Enumerable Truth Table Degrees ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ A superhigh diamond in the c.e. tt-degrees

Cites Work

• Quasicreative Sets
• The upper semilattice of degrees ≤ 0′ is complemented
• Strong reducibilities
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Some Notions of Reducibility and Productiveness
• On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
• Semirecursive Sets and Positive Reducibility
• A note on universal sets

This page was built for publication: Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees