Special splitting in the 2-c.e. Turing degrees

DOI10.1134/s1995080224601322MaRDI QIDQ6634989

R. R. Bagaviev

Publication date: 8 November 2024

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

splittingTuring degree2-c.e. setLachlan's setupper cone avoidance

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Downward density of exact degrees
• Splitting in 2-computably enumerable degrees with avoiding cones
• The d.r.e. degrees are not dense
• On the r. e. predecessors of d. r. e. degrees
• Turing computability: structural theory
• Splitting and cone avoidance in the d.c.e. degrees
• On a hierarchy of sets. III
• On the degrees less than 0'
• On Downey's conjecture
• D.R.E. Degrees and the Nondiamond Theorem
• A Splitting Theorem for the N-R.E. Degrees
• Turing Definability in the Ershov Hierarchy
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion

This page was built for publication: Special splitting in the 2-c.e. Turing degrees