Two theorems on computable numberings

DOI10.1007/BF01875946zbMath0368.02040OpenAlexW2024369109MaRDI QIDQ1242907

Victor L. 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

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

Related Items (6)

Rogers semilattices of punctual numberings ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ On universal pairs in the Ershov hierarchy ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Lattice properties of Rogers semilattices of compuatble and generalized computable families ⋮ One-element Rogers semilattices in the Ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item

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