Strict Superstablity and Decidability of Certain Generic Graphs

DOI10.1007/S41980-019-00234-2MaRDI QIDQ6314866arXivWikidataFDO

Authors Ali N. Valizadeh, M. Pourmahdian

Publication date 1 March 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S41980-019-00234-2

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Models of other mathematical theories (03C65) Infinite graphs (05C63)

arXiv classification

math.COmath.LO

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 $alpha.$ Furthermore, we show that these theories are decidable and pseudofinite.

This page was built for publication: Strict Superstablity and Decidability of Certain Generic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314866)