|
This article is cited in 6 scientific papers (total in 6 papers)
Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets
Yu. L. Ershov
Abstract:
We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.
Keywords:
computable numbering, computably enumerable set, Rogers semilattice.
Received: 21.03.2003
Citation:
Yu. L. Ershov, “Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets”, Algebra Logika, 42:4 (2003), 413–421; Algebra and Logic, 42:4 (2003), 232–236
Linking options:
https://www.mathnet.ru/eng/al38 https://www.mathnet.ru/eng/al/v42/i4/p413
|
Statistics & downloads: |
Abstract page: | 440 | Full-text PDF : | 114 | References: | 49 | First page: | 1 |
|