English
Related papers

Related papers: Independence over arbitrary sets in NSOP$_1$ theor…

200 papers

We give a description of the model theoretic relation of forking independence in terms of the notion of JSJ decompositions in non abelian free groups.

Logic · Mathematics 2013-03-07 Chloé Perin , Rizos Sklinos

We isolate several classes of stationary sets of kappa^omega and investigate implications among them. Under a large cardinal assumption, we prove a structure theorem for stationary sets.

Logic · Mathematics 2007-05-23 Q. Feng , T. Jech , J. Zapletal

We provide a partial answer to a question asked independently by Kim and d'Elb\'ee and show that, under the assumption of the stable Kim-forking conjecture, every $\mathrm{NSOP}_1$ rosy theory must be simple. We also prove that the theory…

Logic · Mathematics 2026-01-14 Alberto Miguel-Gómez

In this paper, we examine how various notions of independence in non-commutative probability theory arise in bi-free probability. We exhibit how Boolean and monotone independence occur from bi-free pairs of faces and establish a Kac/Loeve…

Operator Algebras · Mathematics 2016-09-08 Paul Skoufranis

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

In this note, we prove a result on the independence of $\ell$ for the supports of irreducible perverse sheaves occurring in the Decomposition Theorem, as well as for the family of local systems on each support. It generalizes Gabber's…

Algebraic Geometry · Mathematics 2018-08-16 Shenghao Sun

We present analogues of the Poisson limit distribution for the noncommutative bm-independence, which is associated with several positive symmetric cones. We construct related discrete Fock spaces with creation, annihilation and conservation…

Combinatorics · Mathematics 2023-10-10 Lahcen Oussi , Janusz Wysoczański

We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…

Logic · Mathematics 2025-04-01 Artem Chernikov , Nadja Hempel

We give a complete characterization of the forking independence relation over any set of parameters in the free groups of finite rank, in terms of the $JSJ$ decompositions relative to those parameters.

Group Theory · Mathematics 2020-06-03 Chloé Perin , Rizos Sklinos

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

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…

Logic · Mathematics 2025-07-08 Michele Bailetti

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

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

Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper…

Information Theory · Computer Science 2008-02-05 Cristian Calude , Marius Zimand

Just as Lascar's notion of abstract rank axiomatizes the U-rank, we propose axioms for the ranks $SU^d$ and $SU^f$, the foundation ranks of dividing and forking. We study the relationships between these axioms. As with superstable, we…

Logic · Mathematics 2022-02-15 Santiago Cárdenas-Martín , Rafel Farré

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a…

Logic · Mathematics 2016-08-29 Sebastien Vasey

We give four different independence relations on any exponential field. Each is a canonical independence relation on a suitable Abstract Elementary Class of exponential fields, showing that two of these are NSOP$_1$-like and non-simple, a…

Logic · Mathematics 2023-05-19 Vahagn Aslanyan , Robert Henderson , Mark Kamsma , Jonathan Kirby

We introduce the notion of dependence, as a property of a Keisler measure, and generalize several results of [HPS13] on generically stable measures (in $NIP$ theories) to arbitrary theories. Among other things, we show that this notion is…

Logic · Mathematics 2025-06-09 Karim Khanaki

We propose a generalisation of the Cameron-Erdos conjecture for sum-free sets to arbitrary non-translation invariant linear equations over Z in three or more variables and, using well-known methods from graph theory, prove a weak form of…

Number Theory · Mathematics 2010-09-17 Peter Hegarty