Completeness criteria for a class of reducibilities

DOI10.3103/S1066369X22100012MaRDI QIDQ2688337zbMATH OpenFDO

Authors M. M. Arslanov

Publication date 2 March 2023

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S1066369X22100012

zbMATH Keywords

completeness criterionfixed points of functionm-reducibilityQ-reducibilitytt-reducibilityTuring reducibility

Mathematics Subject Classification ID

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

Cites work

• ASYMPTOTIC INVARIANTS OF SMOOTH MANIFOLDS
• Completeness in the arithmetical hierarchy and fixed points
• Creative sets
• scientific article; zbMATH DE number 3827843 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3544021 (Why is no real title available?)
• scientific article; zbMATH DE number 1232433 (Why is no real title available?)
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• Quasi-completeness and functions without fixed-points

Cited in

(9)

• Completeness of cocompletions
• Functional completeness criteria in Dijkstra algebra
• Sieves and completeness properties
• Detecting completeness from Ext-vanishing
• On existence of complete sets for bounded reducibilities
• scientific article; zbMATH DE number 2101499 (Why is no real title available?)
• scientific article; zbMATH DE number 6155508 (Why is no real title available?)
• ON RELATIVE COMPLETE REDUCIBILITY
• Marat Mirzaevich Arslanov (on his eightieth birthday)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2688337)