English
Related papers

Related papers: An NIP-like Notion in Abstract Elementary Classes

200 papers

We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen lifting properties %(negation) of certain…

Logic · Mathematics 2020-10-20 Misha Gavrilovich

We give an example of an NIP theory $T$ in which there is a formula that does not fork over $\varnothing$ but has measure $0$ under any global $\varnothing$-invariant Keisler measure, and we show that this cannot occur if $T$ is also…

Logic · Mathematics 2023-07-21 Anand Pillay , Atticus Stonestrom

We define weak stable Kim-forking, a notion that generalizes stable forking to the context of NSOP1 theories. We adapt some of the known results on stable forking to this context.

Logic · Mathematics 2025-11-03 Yvon Bossut

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Logic · Mathematics 2009-03-23 Saharon Shelah

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

Logic · Mathematics 2013-05-23 Tarek Sayed Ahmed

In solving hard computational problems, semidefinite program (SDP) relaxations often play an important role because they come with a guarantee of optimality. Here, we focus on a popular semidefinite relaxation of K-means clustering which…

Machine Learning · Computer Science 2018-09-07 Mariano Tepper , Anirvan M. Sengupta , Dmitri Chklovskii

An atom structure is neat if there an algebra based on this atom structure in Nr_nCA_{\omega}. We show that this class is not elementary

Logic · Mathematics 2013-04-04 Tarek Sayed Ahmed

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 investigate the question of whether the restriction of a NIP type $p\in S(B)$ which does not fork over $A\subseteq B$ to $A$ is also NIP, and the analogous question for dp-rank. We show that if $B$ contains a Morley sequence $I$…

Logic · Mathematics 2019-12-17 Pedro Andrés Estevan , Itay Kaplan

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

Artificial Intelligence · Computer Science 2015-03-19 Wolfgang Dvořák

We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we…

Logic · Mathematics 2016-02-22 Åsa Hirvonen , Tapani Hyttinen

Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$\lambda$. We prove that…

Category Theory · Mathematics 2020-09-03 Friedrich Wehrung

We define a class of subsets of a topological space that coincides with the class of compact saturated subsets when the space is sober, and with enough good properties when the space is not sober. This class is introduced especially in view…

General Topology · Mathematics 2011-06-21 Paul Poncet

In the context of abstract elementary classes (AECs) with a monster model, several possible definitions of superstability have appeared in the literature. Among them are no long splitting chains, uniqueness of limit models, and solvability.…

Logic · Mathematics 2018-01-12 Rami Grossberg , Sebastien Vasey

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

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

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

There are many results in the literature where superstablity-like independence notions, without any categoricity assumptions, have been used to show the existence of larger models. In this paper we show that \emph{stability} is enough to…

Logic · Mathematics 2024-05-01 Marcos Mazari-Armida , Wentao Yang

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

We propose the notion of a quasiminimal abstract elementary class (AEC). This is an AEC satisfying four semantic conditions: countable L\"owenheim-Skolem-Tarski number, existence of a prime model, closure under intersections, and uniqueness…

Logic · Mathematics 2018-04-04 Sebastien Vasey