English
Related papers

Related papers: Indiscernibles in monadically NIP theories

200 papers

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…

Logic · Mathematics 2022-12-19 Ali Enayat

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

Group Theory · Mathematics 2021-01-19 João Araújo , Michael Kinyon , Janusz Konieczny , António Malheiro

Expanding maps with indifferent fixed points, a.k.a. intermittent maps, are popular models in nonlinear dynamics and infinite ergodic theory. We present a simple proof of the exactness of a wide class of expanding maps of [0,1], with…

Dynamical Systems · Mathematics 2017-09-04 Marco Lenci

We show that the theory $T_{\log}$ of the asymptotic couple of the field of logarithmic transseries is distal. As distal theories are NIP (= the non-independence property), this provides a new proof that $T_{\log}$ is NIP. Finally, we show…

Logic · Mathematics 2020-11-11 Allen Gehret , Elliot Kaplan

We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…

Logic · Mathematics 2024-04-09 Yatir Halevi , Assaf Hasson , Ya'acov Peterzil

We develop the machinery of indiscernible subspaces in continuous theories of expansions of Banach spaces, showing that any such theory has an indiscernible subspace and therefore an indiscernible set. We extend a result of Shelah and…

Logic · Mathematics 2022-08-12 James Hanson

We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)=A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a…

Logic · Mathematics 2012-08-14 Saharon Shelah , Pierre Simon

We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a…

Logic · Mathematics 2017-05-17 Artem Chernikov , Anand Pillay , Pierre Simon

A graph class $\mathcal C$ is monadically dependent if one cannot interpret all graphs in colored graphs from $\mathcal C$ using a fixed first-order interpretation. We prove that monadically dependent classes can be exactly characterized by…

Seese's conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be…

Logic in Computer Science · Computer Science 2023-08-04 Anuj Dawar , Abhisekh Sankaran

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

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

Logic in Computer Science · Computer Science 2015-07-01 Achim Blumensath , Bruno Courcelle

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

Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…

Logic in Computer Science · Computer Science 2020-04-28 Matthew Hague , Anthony Widjaja Lin , Philipp Rümmer , Zhilin Wu

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

Logic · Mathematics 2022-08-23 Will Johnson

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 initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…

Logic · Mathematics 2023-05-30 Itay Kaplan , Nicholas Ramsey , Pierre Simon

In this paper we investigate hereditarily normal topological groups and their subspaces. We prove that every compact subspace of a hereditarily normal topological group is metrizable. To prove this statement we first show that a…

General Topology · Mathematics 2012-09-11 Raushan Buzyakova

In this paper, we characterize NIP henselian valued fields modulo the theory of their residue field, both in an algebraic and in a model-theoretic way. Assuming the conjecture that every infinite NIP field is either separably closed, real…

Logic · Mathematics 2024-03-14 Sylvy Anscombe , Franziska Jahnke