GENERALIZATIONS OF THE RECURSION THEOREM

DOI10.1017/jsl.2018.52zbMath1477.03163arXiv1803.10843OpenAlexW3100262075MaRDI QIDQ4647121

Sebastiaan A. Terwijn

Publication date: 4 January 2019

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

Full work available at URL: https://arxiv.org/abs/1803.10843

zbMATH Keywords

recursion theoremADN theoremArslanov completeness criterion

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Combinatory logic and lambda calculus (03B40) Other Turing degree structures (03D28)

Related Items

Partial combinatory algebra and generalized numberings ⋮ Fixpoints and relative precompleteness ⋮ Fixed-point selection functions ⋮ Fixed point theorems for precomplete numberings ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ The noneffectivity of Arslanov's completeness criterion and related theorems

Cites Work

• Classical recursion theory. Vol. II
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• Kleene's Amazing Second Recursion Theorem
• Classifying positive equivalence relations
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Universal recursion theoretic properties of r.e. preordered structures
• Theorie der Numerierungen I
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• ∏ 0 1 Classes and Degrees of Theories
• On notation for ordinal numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item