Related papers: Maximal small extensions of o-minimal structures

We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…

Let N be an o-minimal structure. In this paper we develop group extension and group cohomology theory over N and use it to describe the N-definable solvable groups. We prove an o-minimal analogue of the Lie-Kolchin-Mal'cev theorem and we…

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

Ring epimorphisms often induce silting modules and cosilting modules, termed minimal silting or minimal cosilting. The aim of this paper is twofold. Firstly, we determine the minimal tilting and minimal cotilting modules over a tame…

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

For a given d-minimal expansion $\mathfrak R$ of the ordered real field, we consider the expansion $\mathfrak R^\natural$ of $\mathfrak R$ generated by the sets of the form $\bigcup_{S \in \mathcal C}S$, where $\mathcal C$ is a subfamily of…

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…

Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…

We give a short and self-contained proof of the Marker-Steinhorn Theorem for o-minimal expansions of ordered groups, based on an analysis of linear orders definable in such structures.

The goal of this paper is to generalise Alex Rennet's proof of the non-axiomatizability of the class of pseudo-o-minimal structures. Rennet showed that if L is an expansion of the language of ordered fields and K is the class of…

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…

Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

We establish the choice property, a weak analogue of definable choice, for certain tame expansions of o-minimal structures. Most noteworthily, dense pairs of real closed fields have this property.

Two extension problems are solved. First, the class of locally matricial algebras over an arbitrary field is closed under extensions. Second, the class of locally finite dimensional semisimple algebras over a fixed field is closed under…

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…

In arXiv:1303.3724, the authors provide an axiomatic way of constructing new polynomially bounded o-minimal structures. However, all of the structures satisfying these axioms must also have smooth cell-decomposition. In this paper, we…

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…