Recursive versus recursively enumerable binary relations

DOI10.1007/BF01053261MaRDI QIDQ1319364zbMATH OpenOpenAlexFDO

Authors 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

antisymmetrylinearityrecursive relationrecursively isomorphicrecursively enumerable binary relation

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Recursive properties of isomorphism types
• scientific article; zbMATH DE number 1302872
• scientific article; zbMATH DE number 695580
• The relation of recursive isomorphism for countable structures
• RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS

Cites work

• scientific article; zbMATH DE number 3914305 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Effective extensions of partial orders
• R. e. presented linear orders
• Some undecidability results for lattices in recursion theory
• Strong reducibilities
• Two-dimensional partial orderings: Recursive model theory
• tt- and m-degrees

Cited in

(1)

• Array nonrecursiveness and relative recursive enumerability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319364)