The author has previously shown that for a certain class of structures , -indexed indiscernible sets have the modeling property just in case the age of 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. This result is applied to give new proofs that certain classes of trees are Ramsey. To aid this project we develop the logic of EM-types.
"Indiscernibles, EM-Types, and Ramsey Classes of Trees." Notre Dame J. Formal Logic 56 (3) 429 - 447, 2015. https://doi.org/10.1215/00294527-3132797