On existence of complete sets for bounded reducibilities

DOI10.1002/MALQ.200310061MaRDI QIDQ4452450zbMATH OpenOpenAlexFDO

Authors V. K. Bulitko, Vadim Bulitko

Publication date 12 February 2004

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310061

zbMATH Keywords

complete setrecursively enumerable setoracle computationbounded reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On bounded \(m\)-reducibilities
• Completeness criteria for a class of reducibilities
• Reducibility and Completeness for Sets of Integers
• scientific article; zbMATH DE number 4099277
• \(\mathring{B}\)-complete sets: approximative and structural properties
• Strong Reductions and Isomorphism of Complete Sets
• Strong reductions and isomorphism of complete sets
• Exact completion and constructive theories of sets
• A certain reducibility on admissible sets
• ON RELATIVE COMPLETE REDUCIBILITY

Cited in

(6)

• Wholly \((o)\)-bounded sets
• Is a complete, reduced set necessarily of constant width?
• Investigations concerning the structure of complete sets
• Decision reducts and bireducts in a covering approximation space and their relationship to set definability
• BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS
• scientific article; zbMATH DE number 5049507 (Why is no real title available?)

This page was built for publication: On existence of complete sets for bounded reducibilities

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