加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本