Related papers: Externally definable sets and dependent pairs II
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…
Topologies can be expanded with the help of ideals, using the local function, an operator resembling the closure of a set. The aim of this paper is to define the ideals which enable us to create this topology $\tau^{*}$ on $X$…
We initiate a systematic study of the convolution operation on Keisler measures, generalizing the work of Newelski in the case of types. Adapting results of Glicksberg, we show that the supports of generically stable (or just definable,…
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…
Structural properties of unitary groups over local, not necessarily commutative, rings are developed, with applications to the computation of the orders of these groups (when finite) and to the degrees of the irreducible constituents of the…
Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We consider biological individuality in terms of information theoretic and graphical principles. Our purpose is to extract through an algorithmic decomposition system-environment boundaries supporting individuality. We infer or detect…
In 1996, Michaux and Villemaire considered integer relations $R$ which are not definable in Presburger Arithmetic. That is, not definable in first-order logic over integers with the addition function and the order relation…
Statistical latent class models are widely used in social and psychological researches, yet it is often difficult to establish the identifiability of the model parameters. In this paper we consider the identifiability issue of a family of…
We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…
We define and study a higher-dimensional version of model theoretic internality, and relate it to higher-dimensional definable groupoids in the base theory.
We prove the existence of abelian, solvable and nilpotent definable envelopes for groups definable in models of an NTP2 theory.
We study the complex irreducible representations of special linear, symplectic, orthogonal and unitary groups over principal ideal local rings of length two. We construct a canonical correspondence between the irreducible representations of…