Abstract
A general theme of computable structure theory is to investigate when structures have copies of a given complexity . We discuss such problem for the case of equivalence structures and preorders. We show that there is a equivalence structure with no copy, and in fact that the isomorphism types realized by the equivalence structures coincide with those realized by the equivalence structures. We also construct a preorder with no copy.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.