The -Enumeration Degrees

DOI10.1093/LOGCOM/EXM041MaRDI QIDQ5441128zbMATH OpenOpenAlexFDO

Authors Ivan N. Soskov

Publication date 7 February 2008

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exm041

zbMATH Keywords

\(\omega\)-enumeration degreeenumeration reducibilityjump hierarchiesjump operatoruniform reducibility

Mathematics Subject Classification ID

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

Recommendations

• The \(\omega\)-Turing degrees
• The jump operator on the \(\omega \)-enumeration degrees
• Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
• Definability in the local theory of the -enumeration degrees
• ω-Degree Spectra

Cited in

(31)

• The jump operator on the \(\omega \)-enumeration degrees
• Enumeration degrees and topology
• Density of the cototal enumeration degrees
• The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
• Comparing the degrees of enumerability and the closed Medvedev degrees
• The \(\omega\)-Turing degrees
• Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
• A note on initial segments of the enumeration degrees
• Enumeration reducibility and computable structure theory
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Uniform regular enumerations
• Exact enumerations
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Definability in the local theory of the -enumeration degrees
• Enumeration Degrees and Enumerability of Familes
• 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
• Degrees coded in jumps of orderings
• as an initial segment of the c-degrees
• scientific article; zbMATH DE number 1048046 (Why is no real title available?)
• On cototality and the skip operator in the enumeration degrees
• A jump inversion theorem for the infinite enumeration jump
• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• Definability issues in the -Turing degrees
• A structural dichotomy in the enumeration degrees
• Definability in the local structure of the -Turing degrees
• Exact Pair Theorem for the ω-Enumeration Degrees
• η-representation of sets and degrees
• New Computational Paradigms
• Ivan Soskov: a life in computability
• Almost zero and high -Turing degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees

This page was built for publication: The  -Enumeration Degrees

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