On a General Method of Constructing Post Reducibilities and the Corresponding Completeness Criteria

被引：1
|
作者：
Arslanov, M. M. [1 ]
机构：
[1] Kazan Volga Reg Fed Univ, NI Lobachevskii Inst Math & Mech, Kazan 420008, Tatarstan, Russia
来源：
LOBACHEVSKII JOURNAL OF MATHEMATICS | 2022年 / 43卷 / 12期
基金：
俄罗斯科学基金会;
关键词：
turing reducibility; m-reducibility; tt-reducibility; Q-reducibility; fixed points of the function; completeness criterion;
D O I：
10.1134/S1995080222150057
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In computability theory the most common form of reducibility is Turing reducibility. Earlier, the author found necessary and sufficient conditions for the completeness of computably enumerable sets for this reducibility. Later, this criterion was generalized by various authors to new classes of functions, and also investigated for some of the most important reducibilities, stronger than Turing reducibility. In this paper, we discuss one general method for constructing similar criteria for a wide class of reducibility.
引用
收藏
页码：3430 / 3434
页数：5
相关论文
共 50 条
12345