Recursive versus recursively enumerable binary relations

Studia Logica 52 (4):587 - 593 (1993)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
48 (#332,295)

6 months
1 (#1,475,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: American Mathematical Society.
R. e. presented linear orders.Dev Kumar Roy - 1983 - Journal of Symbolic Logic 48 (2):369-376.
Effective extensions of partial orders.Dev Kumar Roy - 1990 - Mathematical Logic Quarterly 36 (3):233-236.

View all 6 references / Add more references