Completeness criteria for a class of reducibilities

DOI10.3103/S1066369X22100012MaRDI QIDQ2688337

Marat M. Arslanov

Publication date: 2 March 2023

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turing reducibilitycompleteness criterionm-reducibilityQ-reducibilityfixed points of functiontt-reducibility

Mathematics Subject Classification ID

Theory of computing (68Qxx) Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)

Cites Work

• Completeness in the arithmetical hierarchy and fixed points
• 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

This page was built for publication: Completeness criteria for a class of reducibilities