English
Related papers

Related papers: On Kim-Independence

200 papers

We give definitions of the properties OP, IP, $k$-TP, TP$_1$, $k$-TP$_2$, SOP$_1$, SOP$_2$ and SOP$_3$ in positive logic, and prove various implications and equivalences between them. We also provide a characterisation of stability in…

Logic · Mathematics 2026-02-11 Anna Dmitrieva , Francesco Gallinaro , Mark Kamsma

Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.

Logic · Mathematics 2018-02-28 Beibut Kulpeshov , Sergey Sudoplatov

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

We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories strict non-forking is…

Logic · Mathematics 2014-10-01 Itay Kaplan , Alexander Usvyatsov

This paper shows that algebraic (in)dependence is encoded in Milnor K-theory of fields. As an application, we show that the isomorphism type of a field is determined by its Milnor K-theory, up to purely inseparable extensions, in most…

K-Theory and Homology · Mathematics 2022-11-29 Adam Topaz

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 give three counterexamples to the folklore claim that in an arbitrary theory, if a complete type $p$ over a set $B$ does not divide over $C\subseteq B$, then no extension of $p$ to a complete type over $\text{acl}(B)$ divides over $C$.…

Logic · Mathematics 2024-11-20 Gabriel Conant , Alex Kruckman

We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.

Logic · Mathematics 2010-01-19 Dov Null Gabbay , Karl Schlechta

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

Logic · Mathematics 2015-08-14 Artem Chernikov , Itay Kaplan , Saharon Shelah

We give an example of an SOP theory $T$, such that any $L(M)$-formula $\varphi(x,y)$ with $|y|=1$ is NSOP. We show that any such $T$ must have the independence property. We also give a simplified proof of Lachlan's theorem that if every…

Logic · Mathematics 2025-07-15 Will Johnson

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Logic · Mathematics 2025-10-17 Jeremy Beard , Marcos Mazari-Armida

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

We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that…

Logic · Mathematics 2011-03-22 Artem Chernikov , Itay Kaplan

We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…

Logic in Computer Science · Computer Science 2021-09-27 Pietro Galliani , Jouko Väänänen

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

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…

Logic · Mathematics 2022-01-19 Itay Kaplan , Ori Segel , Saharon Shelah

In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…

Logic · Mathematics 2024-06-04 Artem Chernikov , Daniel Palacin , Kota Takeuchi

We provide a differential-algebraic description of forking independence in the stable theory DCF$_{p,m}$ of differentially closed fields of characteristic $p>0$ with $m$-many commuting derivations. As a by-product of this description, we…

Logic · Mathematics 2025-11-10 Piotr Kowalski , Omar León Sánchez , Amador Martin-Pizarro

Quantum holonomy theory is a candidate for a non-perturbative theory of quantum gravity coupled to fermions. The theory is based on the QHD(M) algebra, which essentially encodes how matter degrees of freedom are moved on a three-dimensional…

General Relativity and Quantum Cosmology · Physics 2016-10-19 Johannes Aastrup , Jesper M. Grimstrup

For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…

Logic · Mathematics 2026-05-28 Vera Koponen