Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets
We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.
computable numbering computably enumerable set Rogers semilattice
Unable to display preview. Download preview PDF.
© Plenum Publishing Corporation 2003