Generalized nonsplitting in the recursively enumerable degrees

DOI10.2307/2275539zbMATH Open0884.03043OpenAlexW2157757665MaRDI QIDQ4358047FDOQ4358047

Authors: 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

Recommendations

• Splittings of 0' into the Recursively Enumerable Degrees
• Splitting properties of r.e. sets and degrees
• scientific article; zbMATH DE number 3845569
• scientific article; zbMATH DE number 749917

zbMATH Keywords

recursively enumerable degreesnonsplitting theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distribution of Lachlan nonsplitting bases
• Modulo computably enumerable degrees by cupping partners
• Title not available (Why is that?)
• On definable filters in computably enumerable degrees
• A non-splitting theorem in the enumeration degrees
• Genericity and Non-bounding in the Enumeration degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358047)