Recursive versus recursively enumerable binary relations

DOI10.1007/BF01053261zbMath0796.03050OpenAlexW1989224212MaRDI QIDQ1319364

Dev K. Roy

Publication date: 12 April 1994

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01053261

zbMATH Keywords

linearityantisymmetryrecursive relationrecursively isomorphicrecursively enumerable binary relation

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some undecidability results for lattices in recursion theory
• tt- and m-degrees
• Effective extensions of partial orders
• R. e. presented linear orders
• Two-dimensional partial orderings: Recursive model theory
• Strong reducibilities

This page was built for publication: Recursive versus recursively enumerable binary relations