Search arXivSearch

arXiv · 2509.14517

Approximations of the strict order property

Abstract

We observe that the definition of Shelah's classical $\mathrm{NSOP}_{n}$ hierarchy for first-order theories, for integers $n \geq 3$, can be restated so that it extends to the case where $n$ is replaced with any real number $r \geq 3$. Using this observation, we define a potentially larger family of properties $\mathrm{NSOP}_{r}$ for real numbers $r \geq 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, $\mathfrak{o}(\mathcal{H})$, associated with any hereditary class $\mathcal{H}$. We show that, when $\mathcal{H}$ is defined by a finite family of forbidden weakly embedded substructures, $\mathfrak{o}(\mathcal{H})$ is an integer. While Malliaris implicitly showed that the properties $\mathrm{NSOP}_{n}$ are equivalent to closure under helix maps between graphs, both our observation that the properties $\mathrm{NSOP}_{n}$ can be restated so that $n$ can be replaced with any real number at least $3$, and our result that $\mathfrak{o}(\mathcal{H})$ is an integer when $\mathcal{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 $\mathfrak{o}(\mathcal{H})$ is not an integer in general, and therefore that the real-valued $\mathrm{NSOP}_{r}$ hierarchy is distinct from the integer-valued $\mathrm{NSOP}_{n}$ hierarchy at the level of hereditary classes, we show that the statement that $\mathfrak{o}(\mathcal{H})$ is an integer in general cannot be exhibited by interval helix maps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Scott Mutchnik. 2025-09-18. Approximations of the strict order property. https://arxiv.org/abs/2509.14517

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO