Fixed point theorems for precomplete numberings
Fixed point theorems for precomplete numberings
复制标题
预完备编号的不动点定理
DOI:
10.1016/j.apal.2019.04.013
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
S. Terwijn
中科院分区:
文献类型:
--
作者:
H. Barendregt;S. Terwijn
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.
DOI:
10.1523/jneurosci.15-09-06189.1995
发表时间:
1995
期刊:
The Journal of neuroscience : the official journal of the Society for Neuroscience.
影响因子:
--
作者:
Lukasiewicz,PD;Lawrence,JE;Valentino,TL
通讯作者:
Valentino,TL