Switch to: References

Add citations

You must login to add citations.
  1. Recursive versus recursively enumerable binary relations.Dev K. Roy - 1993 - Studia Logica 52 (4):587 - 593.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Linear Order Types of Nonrecursive Presentability.Dev Kumar Roy - 1985 - Mathematical Logic Quarterly 31 (31-34):495-501.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
    The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Weakly semirecursive sets and r.e. orderings.Martin Kummer & Frank Stephan - 1993 - Annals of Pure and Applied Logic 60 (2):133-150.
    Weakly semirecursive sets have been introduced by Jockusch and Owings . In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive sets.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
    		•