Fixed point theorems for precomplete numberings
Logic
2018-10-23 v2 Logic in Computer Science
Abstract
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also holds for every precomplete numbering, and we discuss the relation with Visser's ADN theorem, as well as the uniformity or nonuniformity of the various fixed point theorems. Finally, we base numberings on partial combinatory algebras and prove a generalization of Ershov's theorem in this context.
Cite
@article{arxiv.1809.06233,
title = {Fixed point theorems for precomplete numberings},
author = {H. P. Barendregt and S. A. Terwijn},
journal= {arXiv preprint arXiv:1809.06233},
year = {2018}
}