Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets
- Cite this article as:
- Ershov, Y.L. Algebra and Logic (2003) 42: 232. doi:10.1023/A:1025005309632
- 14 Views
We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.