SearcharxivSearch

arXiv · 2211.04213

Some Remarks on Kim-dividing in NATP Theories

Abstract

In this note, we prove that Kim-dividing over models is always witnessed by a coheir Morley sequence in NATP theories. Following the strategy of Chernikov and Kaplan [8], we obtain some corollaries which hold in NATP theories. Namely, (i) if a formula Kim-forks over a model, then it quasi-divides over the same model, (ii) for any tuple of parameters $b$ and a model $M$, there exists a global coheir $p$ containing $\text{tp}(b/M)$ such that $B \ind^K_M b'$ for all $b'\models p|_{MB}$. We also show that for coheirs in NATP theories, condition (ii) above is a necessary condition for being a witness of Kim-dividing, assuming that a witness of Kim-dividing exists (see Definition 4.1 in this note). That is, if we assume that a witness of Kim-dividing always exists over any given model, then a coheir $p\supseteq \text{tp}(a/M)$ must satisfy (ii) whenever it is a witness of Kim-dividing of $a$ over a model $M$. We also give a sufficient condition for the existence of a witness of Kim-dividing in terms of pre-independence relations. At the end of the paper, we leave a short remark on Mutchnik's recent work [16]. We point out that the class of $\omega$-NDCTP$_2$ theories, a subclass of the class of NATP theories, contains all NTP$_2$ theories and NSOP$_1$ theories. We also note that Kim-forking and Kim-dividing are equivalent over models in $\omega$-NDCTP$_2$ theories, where Kim-dividing is defined with respect to invariant Morley sequences, instead of coheir Morley sequences as in [16].

Explore related subjects

Keep this discovery

BibTeXRIS

Joonhee Kim, Hyoyoon Lee. 2022-11-08. Some Remarks on Kim-dividing in NATP Theories. https://doi.org/10.1017/jsl.2025.10152

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