Comparing the isomorphism types of equivalence structures and preorders
Logic
2020-01-23 v1
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.
Keywords
Cite
@article{arxiv.2001.08017,
title = {Comparing the isomorphism types of equivalence structures and preorders},
author = {Nikolay Bazhenov and Luca San Mauro},
journal= {arXiv preprint arXiv:2001.08017},
year = {2020}
}
Comments
13 pages