Definability in the local structure of the -Turing degrees

DOI10.1017/S0960129519000021zbMATH Open1446.03074OpenAlexW2918045603MaRDI QIDQ5243151FDOQ5243151

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

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

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 (6)

• Undecidability of local structures of s-degrees and Q-degrees
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
• Definability in the local theory of the \(\omega \)-enumeration degrees
• The search for natural definability in the Turing degrees
• Title not available (Why is that?)
• Definability issues in the \(\omega \)-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)