Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
k-triviality collapses to 1-triviality among simple theories, yielding new non-k-ary examples of strongly k-distal theories and implying that certain stable theories are trivial.
citing papers explorer
-
The Finite Length Property of the Rado Graph and Friends
Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
-
Higher-arity distality and forking triviality
k-triviality collapses to 1-triviality among simple theories, yielding new non-k-ary examples of strongly k-distal theories and implying that certain stable theories are trivial.