Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion

DOI10.2307/2274816zbMath0708.03020OpenAlexW4249864666MaRDI QIDQ3489987

Robert M. Solovay, Carl G. jun. Jockusch, Robert I. Soare, Manuel Lerman

Publication date: 1989

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274816

zbMATH Keywords

fixed pointiterated jumpsgeneralization of the Arslanov completeness criterion

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

A Survey of Mučnik and Medvedev Degrees, On the Turing degrees of minimal index sets, Fixpoints and relative precompleteness, \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees, \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Ramsey-type graph coloring and diagonal non-computability, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, Lowness for isomorphism, countable ideals, and computable traceability, Extending and interpreting Post's programme, The d.r.e. degrees are not dense, Fractal dimension versus process complexity, GENERALIZATIONS OF THE RECURSION THEOREM, Randomness, relativization and Turing degrees, On relative randomness, Things that can be made into themselves, Fixed-point selection functions, Precomplete numberings, Ramsey's theorem and cone avoidance, Three Theorems on n-REA Degrees: Proof-Readers and Verifiers, Fixed point theorems for precomplete numberings, Hyperarithmetical Index Sets in Recursion Theory, Calibrating Randomness, The noneffectivity of Arslanov's completeness criterion and related theorems, Diagonally Non-Computable Functions and Bi-Immunity