arXiv:1111.0915 [math.LO]AbstractReferencesReviewsResources
Tree indiscernibilities, revisited
Byunghan Kim, Hyeung-Joon Kim, Lynn Scow
Published 2011-11-03, updated 2013-12-15Version 4
We give definitions that distinguish between two notions of indiscernibility for a set $\{a_\eta \mid \eta \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$_1$ or TP$_2$ 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.
Related articles: Most relevant | Search more
Definitions with no quantifier alternation
arXiv:2305.04244 [math.LO] (Published 2023-05-07)
The Spectra of transitive models
Grades of Discrimination: Indiscernibility, symmetry, and relativity