A nonsplitting theorem in the low₂ Turing degrees

DOI10.1215/00294527-2025-0002MaRDI QIDQ6930123zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 16 September 2025

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-66/issue-3/A-Nonsplitting-Theorem-in-the-Low2-Turing-Degrees/10.1215/00294527-2025-0002.full

zbMATH Keywords

\(\mathrm{low}_2\) degree\(m\)-c.e. degreec.e. degreelow degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Cites work

• D.R.E. Degrees and the Nondiamond Theorem
• Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
• scientific article; zbMATH DE number 4104938 (Why is no real title available?)
• scientific article; zbMATH DE number 3784863 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On a hierarchy of sets. III
• On Downey's conjecture
• On the degrees less than 0'
• Splitting of c.e. degrees and superlowness
• The d.r.e. degrees are not dense
• The Ershov hierarchy
• The recursively enumerable degrees are dense
• There are no maximal low d.c.e. degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Trial and error predicates and the solution to a problem of Mostowski

This page was built for publication: A nonsplitting theorem in the \(\mathrm{low}_2\) Turing degrees

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