An extension of the recursively enumerable Turing degrees

DOI10.1112/JLMS/JDL015zbMATH Open1119.03037OpenAlexW1966623121MaRDI QIDQ5294136FDOQ5294136

Authors: Stephen G. Simpson 

Publication date: 23 July 2007

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/jdl015

Recommendations

• On relative enumerability of Turing degrees
• Turing degrees in refinements of the arithmetical hierarchy
• Generating sets for the recursively enumerable Turing degrees
• The structures inside Turing degrees of recursively enumerable generic sets
• Contiguity and distributivity in the enumerable Turing degrees
• Enumerations, countable structures and Turing degrees
• Decidability and undecidability in the enumerable Turing degrees
• A hierarchy of computably enumerable degrees
• Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
• Publication:4934281

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (30)

• The upward closure of a perfect thin class
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Mass problems associated with effectively closed sets
• The structures inside Turing degrees of recursively enumerable generic sets
• Medvedev degrees of two-dimensional subshifts of finite type
• MASS PROBLEMS AND HYPERARITHMETICITY
• Lawvere-Tierney topologies for computability theorists
• Effectively closed mass problems and intuitionism
• Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
• Generating sets for the recursively enumerable Turing degrees
• Randomness and degree theory for infinite time register machines1
• A survey of Mučnik and Medvedev degrees
• Degrees of Unsolvability: A Tutorial
• Mass problems and measure-theoretic regularity
• Diagonally non-computable functions and bi-immunity
• Title not available (Why is that?)
• Numberings and randomness
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Mass problems and initial segment complexity
• The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable
• Degree Structures: Local and Global Investigations
• Derivation lengths classification of Gödel's T extending Howard's assignment
• The weakness of being cohesive, thin or free in reverse mathematics
• Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely
• On the degree spectrum of a \(\Pi ^0_1\) class
• Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
• DEEP CLASSES
• Strong Turing degrees for additive BSS RAM's
• Immunity for closed sets

This page was built for publication: An extension of the recursively enumerable Turing degrees

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