We give definitions that distinguish between two notions of indiscernibility for a set {aη∣η∈ω>ω}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{a_{\eta} \mid \eta \in ^{\omega>}\omega\}}$$\end{document} that saw original use in Shelah [Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam, 1990], which we name s- and str−indiscernibility. Using these definitions and detailed proofs, we prove s- and str-modeling theorems and give applications of these theorems. In particular, we verify a step in the argument that TP is equivalent (...) to TP1 or TP2 that has not seen explication in the literature. In the Appendix, we exposit the proofs of Shelah [Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam, 1990, App. 2.6, 2.7], expanding on the details. (shrink)

We generalize the Unstable Formula Theorem characterization of stable theories from Shelah [11], that a theory T is stable just in case any infinite indiscernible sequence in a model of T is an indiscernible set. We use a generalized form of indiscernibles from [11], in our notation, a sequence of parameters from an L-structure M, , indexed by an L′-structure I is L′-generalized indiscernible inM if qftpL′=qftpL′ implies tpL=tpL for all same-length, finite ¯,j from I. Let Tg be the theory (...) of linearly ordered graphs in the language with signature Lg={<,R}. Let Kg be the class of all finite models of Tg. We show that a theory T has NIP if and only if any Lg-generalized indiscernible in a model of T indexed by an Lg-structure with age equal to Kg is an indiscernible sequence. (shrink)

The author has previously shown that for a certain class of structures $\mathcal {I}$, $\mathcal {I}$-indexed indiscernible sets have the modeling property just in case the age of $\mathcal {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. 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. (shrink)

We investigate the notion of a semi-retraction between two first-order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We look at semi-retractions through a new lens establishing transfers of the Ramsey property and finite Ramsey degrees under quite general conditions that are optimal as demonstrated by counterexamples. Finally, we compare semi-retractions to the category theoretic notion of a pre-adjunction.

We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We explore how each of these properties interacts with the lexicographic product, full product, and free superposition of classes of structures. Additionally, we consider the classes of theories which admit configurations indexed by these products. In particular, we show that, under mild assumptions, the products considered in this article do not yield (...) new classes of theories. (shrink)