Two theorems on computable numberings

DOI10.1007/BF01875946MaRDI QIDQ1242907zbMATH OpenOpenAlexFDO

Authors Victor Selivanov

Publication date 1977

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

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Logical aspects of Boolean algebras (03G05) Structure theory of lattices (06B05)

Cited in

(9)

• The Rogers semilattices of generalized computable enumerations
• One-element Rogers semilattices in the Ershov hierarchy
• On universal pairs in the Ershov hierarchy
• Lattice properties of Rogers semilattices of compuatble and generalized computable families
• Rogers semilattices of punctual numberings
• Rogers semilattices of limitwise monotonic numberings
• On computable numberings of families of Turing degrees
• On cardinalities of Rogers semilattices for families in the Ershov hierarchy
• Punctual numberings for families of sets

This page was built for publication: Two theorems on computable numberings

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