首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets
Authors:Yu L Ershov
Institution:(1) Trofimuka 10, Novosibirsk, 630090, Russia
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
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号