English
Related papers

Related papers: A note on stability and NIP in one variable

200 papers

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…

Logic · Mathematics 2007-05-23 Saharon Shelah

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

Logic · Mathematics 2013-03-15 Lynn Scow

We prove that, in order to establish that a theory is NSOP$_{1}$, it suffices to show that no formula in a single free variable has SOP$_{1}$.

Logic · Mathematics 2018-11-28 Nicholas Ramsey

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

Logic · Mathematics 2015-09-24 Pierre Simon

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

We show that if a universal theory is not monadically NIP, then this is witnessed by a canonical configuration defined by an existential formula. As a consequence, we show that a hereditary class of relational structures is NIP (resp.…

Logic · Mathematics 2026-02-10 Samuel Braunfeld , Michael C. Laskowski

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

Logic · Mathematics 2026-01-01 Karim Khanaki , Massoud Pourmahdian

We study generically stable measures in the local, NIP context. We show that in this setting, a measure is generically stable if and only if it admits a natural finite approximation.

Logic · Mathematics 2019-09-18 Kyle Gannon

We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…

Logic · Mathematics 2010-01-05 Anand Pillay

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 classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…

Logic · Mathematics 2024-10-24 Daniel Max Hoffmann , Chieu-Minh Tran , Jinhe Ye

We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…

Logic · Mathematics 2021-11-19 Karim Khanaki

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…

Logic · Mathematics 2020-05-22 Gabriel Conant , Kyle Gannon

We study stable like behaviour in first order theories without the independence property. We introduce generically stable measures, give characterizatiions, and show their ubiquity. We also introduce generic compact domination. We also…

Logic · Mathematics 2010-02-26 Ehud Hrushovski , Anand Pillay , Pierre Simon

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

Logic · Mathematics 2023-02-14 Samuel Braunfeld , Anuj Dawar , Ioannis Eleftheriadis , Aris Papadopoulos

Stability is a fundamental notion in dynamical systems and control theory that, traditionally understood, describes asymptotic behavior of solutions around an equilibrium point. This notion may be characterized abstractly as continuity of a…

Dynamical Systems · Mathematics 2023-04-18 James Schmidt

A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…

Category Theory · Mathematics 2023-03-31 Misha Gavrilovich

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

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

Logic · Mathematics 2026-05-06 Samuel Braunfeld , Michael C. Laskowski
‹ Prev 1 2 3 10 Next ›