SearcharxivSearch

arXiv · 2111.02389

On rank not only in NSOP1 theories

Abstract

We introduce a family of local ranks DQ depending on a finite set Q of pairs of the form (\varphi(x,y),q(y)) where \varphi(x,y) is a formula and q(y) is a global type. We prove that in any NSOP1 theory these ranks satisfy some desirable properties; in particular, DQ(x=x)<\omega for any finite variable x and any Q, if q\supseteq p is a Kim-forking extension of types, then DQ(q)<DQ(p) for some Q, and if q\supseteq p is a Kim-non-forking extension, then DQ(q)=DQ(p) for every Q that involves only invariant types whose Morley powers are \ind^K-stationary. We give natural examples of families of invariant types satisfying this property in some NSOP1 theories. We also answer a question of Granger about equivalence of dividing and dividing finitely in the theory T_\infty of vector spaces with a generic bilinear form. We conclude that forking equals dividing in T_\infty, strengthening an earlier observation that T_\infty satisfies the existence axiom for forking independence. Finally, we slightly modify our definitions and go beyond NSOP1 to find out that our local ranks are bounded by the well-known ranks: the inp-rank (burden), and hence, in particular, by the dp-rank. Therefore, our local ranks are finite provided that the dp-rank is finite, for example if T is dp-minimal. Hence, our notion of ranks identifies a non-trivial class of theories containing all NSOP1 and NTP2 theories.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan Dobrowolski, Daniel Max Hoffmann. 2021-11-03. On rank not only in NSOP1 theories. https://arxiv.org/abs/2111.02389

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