A semilattice of numberings. II
DOI10.1007/S10469-010-9100-YzbMATH Open1262.03074OpenAlexW2062966882MaRDI QIDQ694202FDOQ694202
Authors: Vadim 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
Recommendations
admissible setupper semilatticecomputably enumerable set\(\mathbb{A}\)-numbering\(\mathfrak{c}\)-universal semilattice\(m\Sigma\)-reducibilityhereditarily finite superstructurenatural ordinal
Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Semilattices (06A12) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
Cited In (7)
- Distributive lattices of numberings
- Semilattices of punctual numberings
- The universal Lachlan semilattice without the greatest element
- A semantic construction of two-ary integers
- On a semilattice of numberings
- Generalized semilattices and \(m\)-degrees of index sets. II
- Positive numberings in admissible sets
This page was built for publication: A semilattice of numberings. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694202)