Higher-arity distality and forking triviality
Abstract
Answering a question of Goode, we show that -triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our collapse result, along with other facts about -triviality and -total triviality, to generate examples of (strongly) -distal theories. The collapse result immediately implies that no stable theory can be strictly -distal for some , partially answering a question of Walker. Moreover, all known examples of non-distal (strongly) -distal theories are -ary, rendering (strong) -distality moot as a -ary dividing line; we give four classes of examples that are not -ary. We also show that just as distality is not preserved under taking reducts, neither is (strong) -distality.
Keywords
Cite
@article{arxiv.2605.22314,
title = {Higher-arity distality and forking triviality},
author = {Mervyn Tong},
journal= {arXiv preprint arXiv:2605.22314},
year = {2026}
}
Comments
17 pages