scientific article; zbMATH DE number 3914303

MaRDI QIDQ3690801zbMATH OpenFDO

Authors Max Kanovich

Publication date 1982

zbMATH Keywords

inseparabilityreducibilityseparation of a pair of disjoint sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 1747699
• Density of recursively inseparable R. E. Sets and universal recrusively inseparability
• Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
• Computably enumerable sets and related issues
• Degrees of difficulty of generalized r.e. separating classes

Cited in

(8)

• Separation axioms and partitions of the set of natural numbers
• On separating systems with bounded set size
• Degrees of models
• scientific article; zbMATH DE number 3867312 (Why is no real title available?)
• scientific article; zbMATH DE number 5598224 (Why is no real title available?)
• scientific article; zbMATH DE number 1138314 (Why is no real title available?)
• On reduction of the decision problem of recursively enumerable sets to the separability problem
• Complexity properties of recursively enumerable sets and bsQ-completeness

This page was built for publication:

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