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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,205
Through your library
References found in this work BETA
Recursion Theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
R.E. Presented Linear Orders.Dev Kumar Roy - 1983 - 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

18 ( #266,108 of 2,154,168 )

Recent downloads (6 months)

1 ( #397,226 of 2,154,168 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums