The upper semilattice of numerations of a finite set
From MaRDI portal
Publication:1234680
DOI10.1007/BF01668550zbMath0349.02031MaRDI QIDQ1234680
Publication date: 1976
Published in: Algebra and Logic (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)
Related Items (4)
Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 ⋮ Upper Semilattices in Many-One Degrees ⋮ On universal pairs in the Ershov hierarchy ⋮ Computably enumerable sets and related issues
Cites Work
This page was built for publication: The upper semilattice of numerations of a finite set
