Strict Superstablity and Decidability of Certain Generic Graphs
Abstract
We show that the Hrushovski- limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each α∈ω+1\0\ we introduce a strictly superstable theory of U-rank α. Furthermore, we show that these theories are decidable and pseudofinite.
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.