English
Related papers

Related papers: Kim-independence in positive logic

200 papers

We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…

Logic · Mathematics 2013-08-14 Itaï Ben Yaacov , Artem Chernikov

We give several new characterizations of $IP$ (the independence property) and $SOP$ (the strict order property) for continuous first order logic and study their relations to the function theory and the Banach space theory. We suggest new…

Logic · Mathematics 2026-02-02 Karim Khanaki

We study expansions of NSOP$_1$ theories that preserve NSOP$_1$. We prove that if $T$ is a model complete NSOP$_1$ theory eliminating the quantifier $\exists^{\infty}$, then the generic expansion of $T$ by arbitrary constant, function, and…

Logic · Mathematics 2018-09-18 Alex Kruckman , Nicholas Ramsey

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

We characterize nonforking (Morley) sequences in dependent theories in terms of a generalization of Poizat's special sequences and show that average types of Morley sequences are stationary over their domains. We characterize generically…

Logic · Mathematics 2008-10-07 Alexander Usvyatsov

We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced…

Logic · Mathematics 2023-03-24 Mark Kamsma

We develop a framework, in the style of Adler, for interpreting the notion of "witnessing" that has appeared (usually as a variant of Kim's Lemma) in different areas of neostability theory as a binary relation between abstract independence…

Logic · Mathematics 2026-02-20 Alberto Miguel-Gómez

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…

Logic · Mathematics 2021-11-04 Jan Dobrowolski , Daniel Max Hoffmann

In this work we study some examples of groups definable and type-definable in NSOP1 theories. We exhibit some behaviors of these groups that differ from the ones of simple groups. We take interest in the notions of generics and stabilizers,…

Logic · Mathematics 2025-10-31 Yvon Bossut

We give a new characterization of $SOP$ (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a…

Logic · Mathematics 2022-03-23 Karim Khanaki

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

Logic · Mathematics 2007-05-23 Saharon Shelah

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

Logic · Mathematics 2016-02-09 Saharon Shelah

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

Logic · Mathematics 2024-05-31 Adrián Portillo Fernández

We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…

Logic · Mathematics 2023-03-24 Mark Kamsma

We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…

Information Theory · Computer Science 2021-08-18 Cheuk Ting Li

We define weak stable Kim-forking, a notion that generalizes stable forking to the context of NSOP1 theories. We adapt some of the known results on stable forking to this context.

Logic · Mathematics 2025-11-03 Yvon Bossut

Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…

Logic in Computer Science · Computer Science 2025-05-23 Wojciech Przybyszewski , Szymon Toruńczyk

We introduce and examine some special classes of invariant types$\unicode{x2014}$bi-invariant, strongly bi-invariant, extendibly invariant, and reliably invariant types$\unicode{x2014}$and show that they are related to certain…

Logic · Mathematics 2025-07-30 James E. Hanson

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

Logic · Mathematics 2017-09-27 Dimitris Tsementzis

We show that Kim-forking satisfies existence in all NSOP$_1$ theories.

Logic · Mathematics 2025-12-30 Byunghan Kim , Joonhee Kim , Hyoyoon Lee