Related papers: Forking in NTP_2 theories

We prove in particular that, in a large class of dp-minimal theories including the p-adics, definable types are dense amongst non-forking types.

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.

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

We give a characterization of forking in regular ordered Abelian groups. In particular, we prove that the type of C over AB does not fork over A if and only if the type over AB of each C-definable singleton does not fork over A in these…

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…

Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

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…

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

We show that approximations of strict order can calibrate the fine structure of genericity. Particularly, we find exponential behavior within the $\mathrm{NSOP}_{n}$ hierarchy from model theory. Let $0$-$\eth$-independence denote…

Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an…

Fracton theories possess exponentially degenerate ground states, excitations with restricted mobility, and nontopological higher-form symmetries. This paper shows that such theories can be defined on arbitrary spatial lattices in three…

We construct operators which factorize the transfer function associated with a non-self-adjoint 2x2 operator matrix whose diagonal entries can have overlapping spectra and whose off-diagonal entries are unbounded operators.

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

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…

In this note, we prove that Kim-dividing over models is always witnessed by a coheir Morley sequence in NATP theories. Following the strategy of Chernikov and Kaplan [8], we obtain some corollaries which hold in NATP theories. Namely, (i)…

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

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…

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…