Related papers: Pseudo-finite sets, pseudo-o-minimality

Let X be a definable sub-set of some o-minimal structure. We study the spectrum of X, in relation with the definability of types.

We prove Zilber's Trichotomy Conjecture for strongly minimal expansions of two-dimensional groups, definable in o-minimal structures: Theorem. Let M be an o-minimal expansion of a real closed field, (G;+) a 2-dimensional group definable in…

We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

Given a structure $\mathcal{M}$ with a definable topology, its open core is a structure defined on the same universe whose language consists of all open sets of all arities definable in $\mathcal{M}$. In response to questions raised by…

In this paper we give an explicit characterization of o-minimal structures with definable Skolem functions/definable choice. Such structures are, after naming finitely many elements from the prime model, a union of finitely many trivial…

The group configuration in o-minimal structures gives rise, just like in the stable case, to a transitive action of a type-definable group on a partial type. Because $acl=dcl$ the o-minimal proof is significantly simpler than Hrushovski's…

We introduce a covering notion depending on two cardinals, which we call $\mathcal O $-$ [ \mu, \lambda ]$-compactness, and which encompasses both pseudocompactness and many other generalizations of pseudocompactness. For Tychonoff spaces,…

Let $\widetilde{\mathcal M}=\langle \mathcal M, P\rangle$ be an expansion of an o-minimal structure $\mathcal M$ by a dense set $P\subseteq M$, such that three tameness conditions hold. We prove that the induced structure on $P$ by…

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Suppose that $\widetilde{\mathbb R}$ is an o-minimal expansion of the real field in which restricted power functions are definable. We show that if $\widehat{\mathbb R}$ is both a reduct (in the sense of definability) of the expansion…

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

In this paper we prove that for any definable subset $X\subset \mathbb{R}^{n}$ in a polynomially bounded o-minimal structure, with $dim(X)<n$, there is a finite set of regular projections (in the sense of Mostowski ). We give also a weak…

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…