Some applications of the real strict order property hierarchy

Abstract

We give applications of the properties NSOPr for non-integer values of r to problems on the original hierarchy NSOPn for integer values of n. We first show that the properties NSOPr, previously defined for real values r ≥ 3, are even well-defined for real values r ≥ 2, showing that NSOP2 ⊂eq NSOPr for our original definition of NSOPr even when 2 < r < 3. As a consequence, newness of all of the well-defined properties NSOPr for non-integer r would negatively resolve the problem of whether NSOP2 is equal to NSOP3. We then prove an approximate alternative between two possibilities: (1) that in extending Shelah's original NSOPn hierarchy for integers n ≥ 3 to the NSOPr hierarchy for reals r > 2, we really did introduce new classification-theoretic properties, and (2) that NSOPn+1 NTP2 = NSOPn NTP2 for integers n ≥ 3, which would resolve a central open problem in classification theory. More precisely, we give a rigorous sense in which (1) can fail on particularly general grounds, and then show that if (1) fails for these general reasons, (2) must be true. Finally, we apply cycle-removal techniques from the theory of the properties NSOPr for real-values of r to make progress on the question of whether NSOP2 is equal to NSOP3. We (a) show that if H is a hereditary class of structures defined by finitely many forbidden weakly embedded substructures, if every theory whose models have age H has SOP2, then every theory whose models have age H has SOP3, and (b) observe that we cannot replace SOP2 with TP here.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…