SearcharxivSearch

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

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO