A semilattice of numberings. II

DOI10.1007/S10469-010-9100-YzbMath1262.03074OpenAlexW2062966882MaRDI QIDQ694202

V. G. Puzarenko

Publication date: 11 December 2012

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

Full work available at URL: https://doi.org/10.1007/s10469-010-9100-y

zbMATH Keywords

admissible setupper semilatticecomputably enumerable set\(\mathbb{A}\)-numbering\(\mathfrak{c}\)-universal semilattice\(m\Sigma\)-reducibilityhereditarily finite superstructurenatural ordinal

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Semilattices (06A12) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Positive numberings in admissible sets

Cites Work

• On a semilattice of numberings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A semilattice of numberings. II