Generalized nonsplitting in the recursively enumerable degrees

DOI10.2307/2275539zbMath0884.03043OpenAlexW2157757665MaRDI QIDQ4358047

Steven D. Leonhardi

Publication date: 17 March 1998

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

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

zbMATH Keywords

recursively enumerable degreesnonsplitting theorem

Mathematics Subject Classification ID

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

Related Items (2)

On definable filters in computably enumerable degrees ⋮ Modulo computably enumerable degrees by cupping partners

Cites Work

• Undecidability and 1-types in the recursively enumerable degrees
• The density of infima in the recursively enumerable degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The d.r.e. degrees are not dense
• The recursively enumerable degrees have infinitely many one-types
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• Lattice embeddings into the recursively enumerable degrees. II
• The impossibility of finding relative complements for recursively enumerable degrees
• Sublattices of the Recursively Enumerable Degrees

This page was built for publication: Generalized nonsplitting in the recursively enumerable degrees