Supersimplicity and countable reducts of a unidimensional hypersimple theory
Logic
2016-04-05 v1
Abstract
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.
Keywords
Cite
@article{arxiv.1604.00879,
title = {Supersimplicity and countable reducts of a unidimensional hypersimple theory},
author = {Ziv Shami},
journal= {arXiv preprint arXiv:1604.00879},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:0909.4946, arXiv:1311.2225