Definability in the local structure of the ω-Turing degrees

DOI10.1017/S0960129519000021zbMATH Open1446.03074OpenAlexW2918045603MaRDI QIDQ5243151FDOQ5243151

Andrey C. Sariev, Hristo Ganchev

Publication date: 15 November 2019

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129519000021

zbMATH Keywords

definabilityTuring reducibilitydegree structuresjump classes\(\omega\)-Turing degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Degrees joining to 0′
• The  -Enumeration Degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• Automorphisms of the lattice of recursively enumerable sets
• Title not available (Why is that?)
• The \(\omega\)-Turing degrees

Cited In (3)

• Undecidability of local structures of s-degrees and Q-degrees
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• Title not available (Why is that?)

This page was built for publication: Definability in the local structure of the ω-Turing degrees

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