On a semilattice of numberings

DOI10.3103/S1055134410020033zbMath1249.03086OpenAlexW1976410111MaRDI QIDQ2880494

V. G. Puzarenko

Publication date: 13 April 2012

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1055134410020033

zbMATH Keywords

admissible setupper semilatticecomputably enumerable sethereditarily finite superstructurenatural ordinal\(c\)-universal semilattice\(A\)-numbering\(m\Sigma \)-reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Semilattices (06A12) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

Positive numberings in admissible sets ⋮ A semilattice of numberings. II

This page was built for publication: On a semilattice of numberings