SearcharxivSearch

arXiv · 2606.28740

Some applications of the real strict order property hierarchy

Abstract

We give applications of the properties $\mathrm{NSOP}_{r}$ for non-integer values of $r$ to problems on the original hierarchy $\mathrm{NSOP}_{n}$ for integer values of $n$. We first show that the properties $\mathrm{NSOP}_{r}$, previously defined for real values $r \geq 3$, are even well-defined for real values $r \geq 2$, showing that $\mathrm{NSOP}_{2} \subseteq \mathrm{NSOP}_{r}$ for our original definition of $\mathrm{NSOP}_{r}$ even when $2 < r < 3$. As a consequence, newness of all of the well-defined properties $\mathrm{NSOP}_{r}$ for non-integer $r$ would negatively resolve the problem of whether $\mathrm{NSOP}_{2}$ is equal to $\mathrm{NSOP}_{3}$. We then prove an approximate alternative between two possibilities: (1) that in extending Shelah's original $\mathrm{NSOP}_{n}$ hierarchy for integers $n \geq 3$ to the $\mathrm{NSOP}_{r}$ hierarchy for reals $r > 2$, we really did introduce new classification-theoretic properties, and (2) that $\mathrm{NSOP}_{n+1} \cap \mathrm{NTP}_{2} = \mathrm{NSOP}_{n} \cap \mathrm{NTP}_{2}$ for integers $n \geq 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 $\mathrm{NSOP}_{r}$ for real-values of $r$ to make progress on the question of whether $\mathrm{NSOP}_{2}$ is equal to $\mathrm{NSOP}_{3}$. We (a) show that if $\mathcal{H}$ is a hereditary class of structures defined by finitely many forbidden weakly embedded substructures, if every theory whose models have age $\mathcal{H}$ has $\mathrm{SOP}_{2}$, then every theory whose models have age $\mathcal{H}$ has $\mathrm{SOP}_{3}$, and (b) observe that we cannot replace $\mathrm{SOP}_{2}$ with $\mathrm{TP}$ here.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Mutchnik. 2026-06-27. Some applications of the real strict order property hierarchy. https://arxiv.org/abs/2606.28740

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