Completely enumerated sets

DOI10.1007/BF00971653MaRDI QIDQ1224091zbMATH OpenFDO

Authors Yuri L. Ershov

Publication date 1970

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00971653

Mathematics Subject Classification ID

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

Cited in

(6)

• Index Sets and Boolean Operations
• On Non-principal Arithmetical Numberings and Families
• On computable numberings of families of Turing degrees
• Effectively infinite classes of numberings and fixed point theorems
• Control structures in computable numberings and the completion operator
• Relative completeness of arithmetical numberings

This page was built for publication: Completely enumerated sets

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