On reduction of the decision problem of recursively enumerable sets to the separability problem

DOI10.1090/TRANS2/083/02MaRDI QIDQ5582335zbMATH OpenOpenAlexFDO

Authors Albert A. Muchnik

Publication date 1969

Published in American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/trans2/083/02

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• scientific article; zbMATH DE number 3914303
• Some reducibilities and splittings of recursively enumerable sets
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
• Recursively enumerable sets of positive integers and their decision problems
• Decidable subspaces and recursively enumerable subspaces
• DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
• Computably enumerable sets and quasi-reducibility
• scientific article; zbMATH DE number 6277
• scientific article; zbMATH DE number 4087651
• Classes of recursively enumerable sets and Q-reducibility

Cited in

(2)

• Decision reducts and bireducts in a covering approximation space and their relationship to set definability
• scientific article; zbMATH DE number 1089735 (Why is no real title available?)

This page was built for publication: On reduction of the decision problem of recursively enumerable sets to the separability problem

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