RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive
Algebra Logika, 2003 Volume 42, Number 4, Pages 413–421 (Mi al38)
This article is cited 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.

UDC: 517.11

Received: 21.03.2003


 English version: Algebra and Logic, 2003, 42:4, 232–236

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025