English

Results on Colored Tree Properties

Logic 2025-07-10 v1

Abstract

In this paper, we introduce novel variations on several well-known model-theoretic tree properties, and prove several equivalences to known properties. Motivated by the study of generalized indiscernibles, we introduce the notion of the \calI\calI-tree property (\calI\calI-TP), for an arbitrary Ramsey index structure \calI\calI. We focus attention on the colored linear order index structure \textbf{c}, showing that \textbf{c}-TP is equivalent to instability. After introducing \textbf{c}-\TPi\TPi and \textbf{c}-\TPii\TPii, we prove that \textbf{c}-\TPi\TPi is equivalent to \TPi\TPi, and that \textbf{c}-\TPii\TPii is equivalent to IP. We see that these three tree properties give a dichotomy theorem, just as with TP, \TPi\TPi, and \TPii\TPii. Along the way, we observe that appropriately generalized tree index structures \calI<ω\calI^{<\omega} are Ramsey, allowing for the use of generalized tree indiscernibles.

Keywords

Cite

@article{arxiv.2507.06977,
  title  = {Results on Colored Tree Properties},
  author = {Gabriel Day},
  journal= {arXiv preprint arXiv:2507.06977},
  year   = {2025}
}
R2 v1 2026-07-01T03:53:25.746Z