Skip to main content
Springer Nature Link
Log in

Recursive versus recursively enumerable binary relations

  • Published:
Studia Logica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The properties of antisymmetry and linearity are easily seen to be sufficient for a recursively enumerable binary relation to be recursively isomorphic to a recursive relation. Removing either condition allows for the existence of a structure where no recursive isomorph exists, and natural examples of such structures are surveyed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. J. Carroll,Some undecidable results for lattices in recursion theory Pacific Journal of Mathematics 122, no.2 (1986), pp. 319–331.

    Google Scholar 

  2. A. Degtev,tt-and m-degrees Algebra and Logic 12 (1973), pp. 78–89.

    Google Scholar 

  3. A. B. Manaster andJ. G. Rosenstein,Two-dimentional partial orderings: Recursive model theory Journal of Symbolic Logic 45, no1 (1980), pp. 121–132.

    Google Scholar 

  4. A. Nerode andJ. Remmel,A survey of lattices of r.e. substructures Recursion Theory, (Proceedings of Symposia in Pure Mathematics vol. 42), American Mathematical Society, Providence 1985.

    Google Scholar 

  5. P. Odifreddi,Strong reducibilities Bulletin of the American Mathematical Society 4, no.1 (1981), pp. 37–86.

    Google Scholar 

  6. H. Rogers,Theory of Recursive Functions and Effective Computability McGraw-Hill, New York 1967.

    Google Scholar 

  7. D. K. Roy,R.e. presented linear orders Journal of Symbolic Logic 48, no2 (1983), pp. 369–376.

    Google Scholar 

  8. D. K. Roy,Effective extensions of partial orders Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36 (1990), pp. 233–236.

    Google Scholar 

  9. R. Soare,Recursively Enumerable Sets and Degrees Springer-Verlag, Berlin 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Florida International University The State University of Florida at Miami, 33199, Miami, FL, USA

    Dev K. Roy

Authors
  1. Dev K. Roy
    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

Roy, D.K. Recursive versus recursively enumerable binary relations. Stud Logica 52, 587–593 (1993). https://doi.org/10.1007/BF01053261

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01053261

Keywords