English

Higher-arity distality and forking triviality

Logic 2026-05-22 v1

Abstract

Answering a question of Goode, we show that kk-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 kk-triviality and kk-total triviality, to generate examples of (strongly) kk-distal theories. The collapse result immediately implies that no stable theory can be strictly kk-distal for some k3k\geq 3, partially answering a question of Walker. Moreover, all known examples of non-distal (strongly) kk-distal theories are kk-ary, rendering (strong) kk-distality moot as a (k+1)(k+1)-ary dividing line; we give four classes of examples that are not kk-ary. We also show that just as distality is not preserved under taking reducts, neither is (strong) kk-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

R2 v1 2026-07-22T07:25:58.701Z