Recursive versus recursively enumerable binary relations

Studia Logica 52 (4):587 - 593 (1993)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01053261
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,914
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Dev Kumar Roy (1983). R.E. Presented Linear Orders. Journal of Symbolic Logic 48 (2):369-376.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #180,385 of 1,725,629 )

Recent downloads (6 months)

9 ( #72,319 of 1,725,629 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.