English
Related papers

Related papers: Stable embeddedness and NIP

200 papers

A theory $T$ is said to have exact saturation at a singular cardinal $\kappa$ if it has a $\kappa$-saturated model which is not $\kappa^{+}$-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact…

Logic · Mathematics 2015-10-12 Itay Kaplan , Saharon Shelah , Pierre Simon

We study some model-theoretic notions in NIP by means of spectral topology. In the o-minimal setting we relate the o-minimal spectrum with other topological spaces such as the real spectrum and the space of infinitesimal types of Peterzil…

Logic · Mathematics 2024-03-15 Elías Baro , José F. Fernando , Daniel Palacín

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

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 introduce the notion of hereditary G-compactness (with respect to interpretation). We provide a sufficient condition for a poset to not be hereditarily G-compact, which we use to show that any linear order is not hereditarily G-compact.…

Logic · Mathematics 2022-03-11 Tomasz Rzepecki

For G a group definable in an NIP theory we prove that there is a smallest type-definable subgroup H of G such that the quotient G/H is stable. This generalizes the existence of G^00, the smallest type-definable subgroup of G of bounded…

Logic · Mathematics 2016-06-06 Mike Haskel , Anand Pillay

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano

We prove that any type in an NIP theory can be decomposed into a stable part (a generically stable partial type) and a distal-like quotient.

Logic · Mathematics 2017-08-03 Pierre Simon

The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…

Functional Analysis · Mathematics 2018-03-23 Tawseef Rashid , Qamrul Haque Khan

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…

Logic · Mathematics 2024-11-08 Nicolas Chavarria

We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…

Logic · Mathematics 2025-07-18 Saharon Shelah , Alexander Usvyatsov

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Logic · Mathematics 2023-02-17 Saharon Shelah , Alexander Usvyatsov

A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…

Combinatorics · Mathematics 2020-03-05 Maria Chudnovsky , Cemil Dibek , Paul Seymour

A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…

Quantum Physics · Physics 2023-01-18 Mirte van der Eyden , Tim Netzer , Gemma De las Cuevas

This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author.…

Logic · Mathematics 2022-09-20 Christian d'Elbée , Itay Kaplan , Leor Neuhauser

We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…

Logic · Mathematics 2007-05-23 Saharon Shelah

We analyze the embedding properties between Besov spaces, defined on the total space $\mathbb R^n$ and on bounded domains. We give a complete classification on whether or not these embedding maps satisfy certain weak compactness…

Functional Analysis · Mathematics 2025-09-26 Chian Yeong Chuah , Jan Lang , Liding Yao