Fixed point theorems for minimal numberings-Reference-Cited by-同舟云学术

Fixed point theorems for minimal numberings

Published:2023-12-08 Issue: Volume: Page:
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:

Author:

Faizrahmanov Marat¹

Affiliation:

1. Volga Region Scientific-Educational Centre of Mathematics, Kazan (Volga Region) Federal University , 35 Kremlevskaya Str., 420008, Kazan, Russia

Abstract

Abstract This paper considers various forms of the fixed point theorem (Kleene’s recursion theorem with and without parameters, Arslanov’s and Ershov’s recursion theorems) in arbitrary numberings. We prove that the classes of minimal numberings satisfying different of the listed forms of the fixed point theorem are pairwise distinct.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

https://academic.oup.com/logcom/advance-article-pdf/doi/10.1093/logcom/exad074/54122584/exad074.pdf

Reference30 articles.

1. On some generalizations of the fixed point theorem;Arslanov;Soviet Mathematics (Iz. VUZ),1981

2. Fixed-point selection functions;Arslanov;Lobachevskii Journal of Mathematics,2021

3. Completeness criteria for recursively enumerable sets and some general theorems on fixed points;Arslanov;Soviet Mathematics (Iz. VUZ),1977

4. On weakly pre-complete positive equivalences;Badaev;Siberian Mathematical Journal,1991

5. On a problem of S.S. Goncharov;Badaev;Siberian Mathematical Journal,1991

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some properties of classes of minimal numberings of arithmetical set families;Mathematics and Theoretical Computer Science;2024-04-15