A Nonsplitting Theorem in the Low2 Turing Degrees
The paper proves that for any low2 Δ20-degrees x0 and x1, there exists a low 2-c.e. degree a such that a≠y0∪y1 for all degrees y0⩽x0 and y1⩽x1. It follows that for all m>1 and n=1,2, the posets of lown c.e. and lown m-c.e. degrees are not elementarily equivalent.
Authors
- M. Kh. Faĭzrahmanov (ORCID: https://orcid.org/0000-0002-4519-9696)
Institutions
- Kazan Federal University (RU)
Publication Details
- Journal
- Notre Dame Journal of Formal Logic
- Published
- 2025-08-01
- DOI
- https://doi.org/10.1215/00294527-2025-0002
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00