In this paper we develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable sets, definable functions are almost everywhere continuous, and definable sets are finite unions of graphs of definable continuous “multi-valued f...

Let (K, v) be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map. The main step in obtaining this partition is an answer to the question, given a polynomial f(x) ∈ K[x], what is v(f(x))? Two applications are given: fir...

In this series of lectures, we will a) introduce the basics of ominimality, b) describe the manifold topology of groups definable in o-minimal structures, and c) present a structure theorem for the special case of semi-linear groups, exemplifying their relation with real Lie groups. The structure of these lectures is as follows: (1) Basics of o-minimality: definition, Cell Decomposition Theorem...

In this short note we provide an example of a semi-linear group G which does not admit a semi-linear affine embedding; in other words, there is no semi-linear isomorphism between topological groups f : G → G′ ⊆ Mm, such that the group topology on G′ coincides with the subspace topology induced by Mm. Let M be an o-minimal structure. By “definable” we mean “definable in M” possibly with paramete...

The aim of this work is to show that the universal theory R of real closed fields [1] is interpretable in the equational theory of LPi1/2-algebras [2,3,6,7,8], and viceversa. Since R enjoys quantifier elimination, we will obtain that the full theory of R is interpretable in LPi1/2. This will also yield that any function definable in R is definable in LPi1/2. As a consequence of this constructio...

In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [2, 4]). We introduce the notion of timed hypergraph morphism and show that it is: – Sound: if there exists a timed morphism from Hf to Hg then f is PCF-definable relatively to g. – Complete for subsequential functions: if f is PCF-definable relatively to g, and g ...