SearcharxivSearch

arXiv · 2105.07788

Kim-independence in positive logic

Abstract

An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced by another independence notion, called Kim-independence. We generalise Kim-independence over models in NSOP$_1$ theories to positive logic -- a proper generalisation of first-order logic where negation is not built in, but can be added as desired. For example, an important application is that we can add hyperimaginary sorts to a positive theory to get another positive theory, preserving NSOP$_1$ and various other properties. We prove that, in a thick positive NSOP$_1$ theory, Kim-independence over existentially closed models has all the nice properties that it is known to have in a first-order NSOP$_1$ theory. We also provide a Kim-Pillay style theorem, characterising which thick positive theories are NSOP$_1$ by the existence of a certain independence relation. Furthermore, this independence relation must then be the same as Kim-independence. Thickness is the mild assumption that being an indiscernible sequence is type-definable. In first-order logic Kim-independence is defined in terms of Morley sequences in global invariant types. These may not exist in thick positive theories. We solve this by working with Morley sequences in global Lascar-invariant types, which do exist in thick positive theories. We also simplify certain tree constructions that were used in the study of Kim-independence in first-order theories. In particular, we only work with trees of finite height.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Dobrowolski, Mark Kamsma. 2021-05-17. Kim-independence in positive logic. https://doi.org/10.2140/mt.2022.1.55

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