On a general method of constructing post reducibilities and the corresponding completeness criteria

DOI10.1134/S1995080222150057MaRDI QIDQ2700039

Marat M. Arslanov

Publication date: 20 April 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turing reducibilitycompleteness criterion\(m\)-reducibility\(Q\)-reducibilityfixed points of function\(tt\)-reducibility

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) History of mathematics and mathematicians (01Axx) Computability and recursion theory (03Dxx)

Cites Work

• Quasi-completeness and functions without fixed-points
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• ASYMPTOTIC INVARIANTS OF SMOOTH MANIFOLDS
• Creative sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item