Fixpoints and relative precompleteness
From MaRDI portal
Publication:5075519
DOI10.3233/COM-210344OpenAlexW3128005974MaRDI QIDQ5075519
Anton Golov, Sebastiaan A. Terwijn
Publication date: 16 May 2022
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.12271
Cites Work
- The noneffectivity of Arslanov's completeness criterion and related theorems
- Classical recursion theory. The theory of functions and sets of natural numbers
- Index sets of quotient objects of the Post numeration
- Jumps of computably enumerable equivalence relations
- Fixed point theorems for precomplete numberings
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- A Survey on Universal Computably Enumerable Equivalence Relations
- A Note on Positive Equivalence Relations
- Kleene's Amazing Second Recursion Theorem
- Classifying positive equivalence relations
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- Theorie der Numerierungen I
- GENERALIZATIONS OF THE RECURSION THEOREM
- Joins and meets in the structure of ceers
- On notation for ordinal numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item