More on tree properties

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 or TP2. 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-strong order property). Recently it is proved that in any NSOP1 theory (i.e. a theory not having SOP1) 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 (which is equivalent to TP1) and SOP1. In addition, we study relationships between TP2 and Kim-forking, and obtain that a theory is supersimple iff there is no countably infinite Kim-forking chain.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…