Skip to main content
SpringerLink
Log in

Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets

  • Published:
Algebra and Logic Aims and scope

Abstract

We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Yu. L. Ershov, Numbering Theory [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  2. S. D. Denisov, “The structure of an upper semilattice of recursively enumerable m-degrees and related problems. 1,” Algebra Logika, 17, No. 6, 643–683 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trofimuka 10, Novosibirsk, 630090, Russia

    Yu. L. Ershov

Authors
  1. Yu. L. Ershov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ershov, Y.L. Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets. Algebra and Logic 42, 232–236 (2003). https://doi.org/10.1023/A:1025005309632

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025005309632

Search

Navigation