On some examples of upper semilattices of computable enumerations

DOI10.1007/BF02218587MaRDI QIDQ1217117zbMATH OpenOpenAlexFDO

Authors Vladimir V. V'yugin

Publication date 1975

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/186810

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Cites work

• On computable enumerations. I

Cited in

(7)

• Two theorems on minimal generalized computable numberings
• The Rogers semilattices of generalized computable enumerations
• Theories of Rogers semilattices of analytical numberings
• Reductions between types of numberings
• Ideals without minimal elements in Rogers semilattices
• A family with a single minimal but not least numbering
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09

This page was built for publication: On some examples of upper semilattices of computable enumerations

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