A decomposition of the Rogers semilattice of a family of d.c.e. sets

DOI10.2178/jsl/1243948330zbMath1185.03071OpenAlexW2086700849MaRDI QIDQ3630582

S. A. Badaev, Steffen Lempp

Publication date: 4 June 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.496.1965

zbMATH Keywords

numberingFriedberg numberingRogers semilatticed.c.e. setKhutoretskiĭ's theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items

Rogers semilattices of punctual numberings ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Two theorems on minimal generalized computable numberings ⋮ Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Extremal numberings and fixed point theorems ⋮ A family with a single minimal but not least numbering ⋮ On universal pairs in the Ershov hierarchy ⋮ Friedberg numberings of families of partial computable functionals ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ Reductions between types of numberings ⋮ Families without minimal numberings

Cites Work

• Positive numerations of families with one-valued numerations
• Theorie der Numerierungen I
• Theorie Der Numerierungen III

This page was built for publication: A decomposition of the Rogers semilattice of a family of d.c.e. sets