Tree indiscernibilities, revisited
Logic
2013-12-25 v4
Abstract
We give definitions that distinguish between two notions of indiscernibility for a set that saw original use in \cite{sh90}, which we name \textit{-} and \textit{-indiscernibility}. Using these definitions and detailed proofs, we prove - and -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.
Cite
@article{arxiv.1111.0915,
title = {Tree indiscernibilities, revisited},
author = {Byunghan Kim and Hyeung-Joon Kim and Lynn Scow},
journal= {arXiv preprint arXiv:1111.0915},
year = {2013}
}
Comments
submitted