The impossibility of finding relative complements for recursively enumerable degrees

DOI10.2307/2270459zbMATH Open0156.01001OpenAlexW1986222532WikidataQ56430700 ScholiaQ56430700MaRDI QIDQ5537366FDOQ5537366

Alistair H. Lachlan

Publication date: 1966

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

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

zbMATH Keywords

mathematical logic

Cites Work

• The recursively enumerable degrees are dense
• Recursively enumerable sets of positive integers and their decision problems

Cited In (10)

• Generalized nonsplitting in the recursively enumerable degrees
• Minimal upper bounds for arithmetical degrees
• Recursively enumerable sets and degrees
• The upper semilattice of degrees ≤ 0′ is complemented
• Degree Structures: Local and Global Investigations
• Definability in the Recursively Enumerable Degrees
• Complementation in the Turing degrees
• Minimal complementation below uniform upper bounds for the arithmetical degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• The decision problem for recursively enumerable degrees

This page was built for publication: The impossibility of finding relative complements for recursively enumerable degrees

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