The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees

DOI10.2307/2000006zbMath0512.03023OpenAlexW4230156888MaRDI QIDQ4750633

Steven Schwarz

Publication date: 1984

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

zbMATH Keywords

semi-latticeSacks' splitting theoremrecursively enumerable degrees of unsolvability

Mathematics Subject Classification ID

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

Related Items (2)

Modulo computably enumerable degrees by cupping partners ⋮ The contiguity in R/M.

Cites Work

• Unnamed Item
• Unnamed Item
• Splitting properties and jump classes
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Recursively enumerable generic sets
• The infinite injury priority method
• Recursively enumerable sets and degrees
• Computational complexity of recursively enumerable sets
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees