Tree indiscernibilities, revisited
Abstract
We give definitions that distinguish between two notions of indiscernibility for a set \aη η ∈ \ that saw original use in sh90, which we name - and -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 TP1 or TP2 that has not seen explication in the literature. In the Appendix, we exposit the proofs of [App. 2.6, 2.7]sh90, expanding on the details.
0