Tree indiscernibilities, revisited
arXiv:1111.0915 · doi:10.1007/s00153-013-0363-6
Abstract
We give definitions that distinguish between two notions of indiscernibility for a set $\{a_η\mid η\in \W\}$ that saw original use in \cite{sh90}, which we name \textit{$\s$-} and \textit{$\n$-indiscernibility}. Using these definitions and detailed proofs, we prove $\s$- and $\n$-modeling theorems and give applications of these theorems. In particular, we verify a step in the argument that TP is equivalent to TP or TP that has not seen explication in the literature. In the Appendix, we exposit the proofs of \citep[{App. 2.6, 2.7}]{sh90}, expanding on the details.
submitted
References in corpus (1)
Cited by in corpus (10)
- Indiscernibles, EM-types, and Ramsey Classes of Trees
- Kim-independence in positive logic
- Dividing Lines between Positive Theories
- Positive indiscernibles
- The additive groups of and with predicates for being square-free
- Henkin constructions of models with size continuum
- Some Remarks on Kim-dividing in NATP Theories
- Preservation of NATP
- Bounded ultraimaginary independence and its total Morley sequences
- Generic derivations, differential largeness, and NTP