Indiscernibles, EM-Types, and Ramsey Classes of Trees
@article{Scow2015IndiscerniblesEA,
title={Indiscernibles, EM-Types, and Ramsey Classes of Trees},
author={Lynn Scow},
journal={Notre Dame J. Formal Log.},
year={2015},
volume={56},
pages={429-447}
}It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered structures in a finite relational language to ordered, locally finite structures which isolate quantifier-free types by way of quantifier-free formulas. As a corollary, we may conclude that certain classes of finite trees are Ramsey, some previously known. See… CONTINUE READING
Topics from this paper.
7 Citations
References
SHOWING 1-10 OF 46 REFERENCES
On uniform definability of types over finite sets
- Mathematics, Computer Science
- J. Symb. Log.
- 2012
- 20
- PDF
Characterization of NIP theories by ordered graph-indiscernibles
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2012
- 16
- PDF
On the existence of indiscernible trees
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2012
- 10
- Highly Influential
Classification theory - and the number of non-isomorphic models, Second Edition
- Mathematics, Computer Science
- Studies in logic and the foundations of mathematics
- 1990
- 320
Karp complexity and classes with the independence property
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2003
- 12
- PDF
The stability spectrum for Classes of Atomic Models
- Mathematics, Computer Science
- J. Math. Log.
- 2012
- 8
- PDF