Stability theory, Permutations of Indiscernibles, and Embedded Finite Models∗


We show that the expressive power of first-order logic over finite models embedded in a model M is determined by stability-theoretic properties of M . In particular, we show that if M is stable, then every class of finite structures that can be defined by embedding the structures in M , can be defined in pure first-order logic. We also show that if M does… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics