On completeness of pseudosimple sets

MaRDI QIDQ4942246zbMATH OpenFDO

Authors Vadim Bulitko

Publication date 7 May 2000

zbMATH Keywords

completenesseffectivizationextensionally bounded functionspseudosimple setsrecursively enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cited in

(3)

• On p-creative sets and p-completely creative sets
• Robustness of PSPACE-complete sets
• scientific article; zbMATH DE number 865858 (Why is no real title available?)

This page was built for publication: On completeness of pseudosimple sets

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