The noneffectivity of Arslanov's completeness criterion and related theorems

DOI10.1007/s00153-020-00712-zzbMath1481.03032arXiv1804.01522OpenAlexW3001118022WikidataQ126301017 ScholiaQ126301017MaRDI QIDQ781514

Sebastiaan A. Terwijn

Publication date: 17 July 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

uniformityrecursion 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 (3)

Fixpoints and relative precompleteness ⋮ Fixed-point selection functions ⋮ Fixed point theorems for precomplete numberings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. Vol. II
• Kolmogorov complexity and the Recursion Theorem
• Kleene's Amazing Second Recursion Theorem
• Classifying positive equivalence relations
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• GENERALIZATIONS OF THE RECURSION THEOREM
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• ∏ 0 1 Classes and Degrees of Theories
• On notation for ordinal numbers

This page was built for publication: The noneffectivity of Arslanov's completeness criterion and related theorems