Definability in the local structure of the -Turing degrees

DOI10.1017/S0960129519000021MaRDI QIDQ5243151zbMATH OpenOpenAlexFDO

Authors Hristo Ganchev, Andrey C. Sariev

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)

Recommendations

• The \(\omega\)-Turing degrees
• scientific article; zbMATH DE number 7360060
• Definability in the local theory of the \(\omega \)-enumeration degrees
• Definability issues in the \(\omega \)-Turing degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees

Cites work

• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• Automorphisms of the lattice of recursively enumerable sets
• Degrees joining to 0′
• The \(\omega\)-Turing degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• The  -Enumeration Degrees

Cited in

(6)

• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• Definability issues in the \(\omega \)-Turing degrees
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• Definability in the local theory of the \(\omega \)-enumeration degrees
• Undecidability of local structures of s-degrees and Q-degrees
• The search for natural definability in the Turing degrees

This page was built for publication: Definability in the local structure of the \(\omega\)-Turing degrees

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