English

More on tree properties

Logic 2019-07-05 v3

Abstract

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP1_1 or TP2_2. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion as it satisfies symmetry, transitivity, extension, local character, and type-amalgamation. Shelah also introduced SOPn_n (nn-strong order property). Recently it is proved that in any NSOP1_1 theory (i.e. a theory not having SOP1_1) holding nonforking existence, Kim-forking also satisfies all the mentioned independence properties except base monotonicity (one direction of transitivity). These results are the sources of motivation for this paper. Mainly, we produce type-counting criteria for SOP2_2 (which is equivalent to TP1_1) and SOP1_1. In addition, we study relationships between TP2_2 and Kim-forking, and obtain that a theory is supersimple iff there is no countably infinite Kim-forking chain.

Keywords

Cite

@article{arxiv.1902.08911,
  title  = {More on tree properties},
  author = {Enrique Casanovas and Byunghan Kim},
  journal= {arXiv preprint arXiv:1902.08911},
  year   = {2019}
}
R2 v1 2026-06-23T07:49:09.215Z