Higher-arity distality and forking triviality

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…