Approximations of the strict order property
Abstract
We observe that the definition of Shelah's classical NSOPn hierarchy for first-order theories, for integers n ≥ 3, can be restated so that it extends to the case where n is replaced with any real number r ≥ 3. Using this observation, we define a potentially larger family of properties NSOPr for real numbers r ≥ 3. Motivated by the question of whether the integer-valued and real-valued hierarchies are distinct, we translate these hierarchies into the setting of hereditary classes, obtaining a new real-valued quantity of independent combinatorial interest, o(H), associated with any hereditary class H. We show that, when H is defined by a finite family of forbidden weakly embedded substructures, o(H) is an integer. While Malliaris implicitly showed that the properties NSOPn are equivalent to closure under helix maps between graphs, both our observation that the properties NSOPn can be restated so that n can be replaced with any real number at least 3, and our result that o(H) is an integer when H is a hereditary class defined by a finite family of forbidden weakly embedded substructures, are even exhibited by a special class of helix maps, the interval helix maps. These are helix maps that respect the direction of edges, and whose regions are disjoint unions of linearly ordered sets without any edges between them. Toward showing the conjectural claim that o(H) is not an integer in general, and therefore that the real-valued NSOPr hierarchy is distinct from the integer-valued NSOPn hierarchy at the level of hereditary classes, we show that the statement that o(H) is an integer in general cannot be exhibited by interval helix maps.
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.