English
Related papers

Related papers: An independence theorem for NTP2 theories

200 papers

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 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

Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…

Logic · Mathematics 2019-02-19 Michael Lieberman , Jiří Rosický , Sebastien Vasey

We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP$_{1}$ theory. We deduce symmetry of Kim-independence and the independence…

Logic · Mathematics 2019-09-19 Jan Dobrowolski , Byunghan Kim , Nicholas Ramsey

We prove some results about the theory of independence in $\mathrm{NSOP}_{3}$ theories that do not hold in $\mathrm{NSOP}_{4}$ theories. We generalize Chernikov's work on simple and co-simple types in $\mathrm{NTP}_{2}$ theories to types…

Logic · Mathematics 2026-05-29 Scott Mutchnik

Kim's Lemma is a key ingredient in the theory of forking independence in simple theories. It asserts that if a formula divides, then it divides along every Morley sequence in type of the parameters. Variants of Kim's Lemma have formed the…

Logic · Mathematics 2024-08-14 Alex Kruckman , Nicholas Ramsey

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 prove a couple of results on NTP2 theories. First, we prove an amalgamation statement and deduce from it that the Lascar distance over extension bases is bounded by 2. This improves previous work of Ben Yaacov and Chernikov. We propose a…

Logic · Mathematics 2020-11-11 Pierre Simon

We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there…

Logic · Mathematics 2013-08-15 Artem Chernikov

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP$_1$ or TP$_2$. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion…

Logic · Mathematics 2019-07-05 Enrique Casanovas , Byunghan Kim

An axiomatic treatment of `independence relations' (notions of independence) for complete first-order theories is presented, the principal examples being forking (due to Shelah) and thorn-forking (due to Onshuus). Thorn-forking is…

Logic · Mathematics 2007-05-23 Hans Adler

The classes stable, simple and NSOP$_1$ in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one…

Logic · Mathematics 2024-05-22 Mark Kamsma

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

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

Logic · Mathematics 2013-12-25 Saharon Shelah

We adapt the properties of Kim-independence in NSOP1 theories with existence proven in [5],[4] and [2] by Ramsey, Kaplan, Chernikov, Dobrowolski and Kim to hyperimaginaries by adding the assumption of existence for hyperimaginaries. We show…

Logic · Mathematics 2022-10-26 Yvon Bossut

We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…

Logic · Mathematics 2024-10-15 Amador Martin-Pizarro

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 develop a new notion of independence suggested by Scanlon (th-independence). We prove that in a large class of theories (which includes all simple theories) this notion has many of the properties needed for an adequate geometric…

Logic · Mathematics 2007-05-23 Alf Onshuus

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…

Logic · Mathematics 2023-03-29 Jan Dobrowolski , Mark Kamsma

We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees with dividing,…

Logic · Mathematics 2020-01-09 Will Johnson
‹ Prev 1 2 3 10 Next ›