The upper semilattice of numerations of a finite set

DOI10.1007/BF01668550MaRDI QIDQ1234680zbMATH OpenFDO

Authors Yuri L. Ershov

Publication date 1976

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

Full work available at URL https://doi.org/10.1007/BF01668550

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Cites work

• Initial Segments of Many-One Degrees

Cited in

(4)

• On universal pairs in the Ershov hierarchy
• Upper Semilattices in Many-One Degrees
• Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
• Computably enumerable sets and related issues

This page was built for publication: The upper semilattice of numerations of a finite set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234680)