Strict Superstablity and Decidability of Certain Generic Graphs
arXiv:1903.00272 · doi:10.1007/s41980-019-00234-2
Abstract
We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each we introduce a strictly superstable theory of U-rank Furthermore, we show that these theories are decidable and pseudofinite.