Strict Superstablity and Decidability of Certain Generic Graphs
Logic
2025-10-16 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1903.00272,
title = {Strict Superstablity and Decidability of Certain Generic Graphs},
author = {Ali N. Valizadeh and Massoud Pourmahdian},
journal= {arXiv preprint arXiv:1903.00272},
year = {2025}
}