Fixed point theorems for precomplete numberings

DOI10.1016/j.apal.2019.04.013zbMath1454.03049arXiv1809.06233OpenAlexW2890683191WikidataQ127986194 ScholiaQ127986194MaRDI QIDQ2311209

Hendrik Pieter Barendregt, Sebastiaan A. Terwijn

Publication date: 10 July 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

ADN theoremArslanov completeness criterionpartial combinatory algebrasprecomplete numberingsErshov recursion theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40)

Related Items

Partial combinatory algebra and generalized numberings, Fixpoints and relative precompleteness, Numberings, c.e. oracles, and fixed points, Extremal numberings and fixed point theorems, On the main scientific achievements of Victor Selivanov, Fixed-point selection functions, COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS, ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The noneffectivity of Arslanov's completeness criterion and related theorems
• Realizability. An introduction to its categorical side
• Classical recursion theory. Vol. II
• Positive equivalences
• Degrees of members of \(\Pi_ 1^ 0\) classes
• On degrees of unsolvability
• A Survey on Universal Computably Enumerable Equivalence Relations
• A Note on Positive Equivalence Relations
• Algorithmic Randomness and Complexity
• Kleene's Amazing Second Recursion Theorem
• Classifying positive equivalence relations
• Higher-Order Computability
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Calculating self-referential statements
• Theorie der Numerierungen I
• THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
• GENERALIZATIONS OF THE RECURSION THEOREM
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• ∏ 0 1 Classes and Degrees of Theories
• The þ-function in λ-K-conversion