English
Related papers

Related papers: Externally definable sets and dependent pairs II

200 papers

We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.

Logic · Mathematics 2008-02-01 Alexander Usvyatsov

I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…

Logic · Mathematics 2024-03-13 Seyed-Mohammad Bagheri

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

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 introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Logic · Mathematics 2025-04-03 Juan Felipe Carmona , Alf Onshuus

In this short note, using results of Bourgain, Fremlin, and Talagrand \cite{BFT}, we show that for a countable structure $M$, a saturated elementary extension $M^*$ of $M$ and a formula $\phi(x,y)$ the following are equivalent: (i)…

Logic · Mathematics 2017-04-04 Karim Khanaki

Let $T$ be a consistent o-minimal theory extending the theory of densely ordered groups and let $T'$ be a consistent theory. Then there is a complete theory $T^*$ extending $T$ such that $T$ is an open core of $T^*$, but every model of…

Logic · Mathematics 2017-10-10 Philipp Hieronymi , Travis Nell , Erik Walsberg

A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…

Logic · Mathematics 2021-10-15 Alfred Dolich , John Goodrick

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

Logic · Mathematics 2021-06-07 Athar Abdul-Quader , Roman Kossak

We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…

Logic · Mathematics 2017-12-21 Artem Chernikov , Pierre Simon

We consider general structures where formulas have truth values in the real unit interval as in continuous model theory, but whose predicates and functions need not be uniformly continuous with respect to a distance predicate. Every general…

Logic · Mathematics 2020-10-27 H. Jerome Keisler

For a NIP theory $T$, a sufficiently saturated model $\mathfrak{C}$ of $T$, and an invariant (over some small subset of $\mathfrak{C}$) global type $p$, we prove that there exists a finest relatively type-definable over a small set of…

Logic · Mathematics 2025-07-16 Krzysztof Krupiński , Adrián Portillo

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

Logic · Mathematics 2015-09-24 Pierre Simon

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…

Logic in Computer Science · Computer Science 2023-06-22 Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Logic in Computer Science · Computer Science 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…

Logic · Mathematics 2021-04-19 Itay Kaplan , Nicholas Ramsey , Saharon Shelah

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

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

Logic · Mathematics 2024-11-14 Fornasiero Antongiulio , Terzo Giuseppina

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

A new characterization is given to describe implication bases of a closure system in terms of the system's quasi-closed sets. Using this characterization, it is possible to show that groups of implications corresponding to distinct…

Logic · Mathematics 2023-05-30 Todd Bichoupan