We calculate the universal Euler characteristic and universal dimension function on semilinear and semibounded sets and obtain some criteria for definable equivalence of semilinear and semibounded sets in terms of these invariants.

In this paper, we consider reducts of p-adically closed fields. We introduce a notion of shadows: sets Mf={∈K2∣|y|=|f|}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_f = \{ \in K^2 \mid |y| = |f|\}}$$\end{document}, where f is a semi-algebraic function. Adding symbols for such sets to a reduct of the ring language, we obtain expansions of the semi-affine language where multiplication is nowhere definable, thus giving a negative answer to a question posed by Marker, Peterzil and Pillay. The second (...) main result of this paper is the fact that in p-adic fields, full multiplication becomes definable if we add a rational function to the semi-affine language. (shrink)

We develop a notion of cell decomposition suitable for studying weak p-adic structures definable). As an example, we consider a structure with restricted addition.

We study a reduct ${\mathcal{L}_*}$ of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the ${\mathcal{L}_*}$ -definable subsets of K coincide with the semi-algebraic subsets of K. Hence structures (K, ${\mathcal{L}_*}$ ) can be seen as the p-adic counterpart of the o-minimal structure of semibounded sets. We show that in this language, p-adically closed fields admit cell decomposition, using cells similar to p-adic semi-algebraic cells. From (...) this we can derive quantifier-elimination, and give a characterization of definable functions. In particular, we conclude that multiplication can only be defined on bounded sets, and we consider the existence of definable Skolem functions. (shrink)

The following two assertions are equivalent for an o-minimal expansion of an ordered group $$\mathcal M=(M,<,+,0,\ldots )$$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous function $$f:A \rightarrow M$$ defined on a definable closed subset of $$M^n$$ has a definable continuous extension $$F:M^n \rightarrow M$$.

Let be an o‐minimal expansion of an ordered group, and a dense set such that certain tameness conditions hold. We introduce the notion of a product cone in, and prove: if expands a real closed field, then admits a product cone decomposition. If is linear, then it does not. In particular, we settle a question from [10].

We describe a recent program from the study of definable groups in certain o-minimal structures. A central notion of this program is that of a lattice. We propose a definition of a lattice in an arbitrary first-order structure. We then use it to describe, uniformly, various structure theorems for o-minimal groups, each time recovering a lattice that captures some significant invariant of the group at hand. The analysis first goes through a local level, where a pertinent notion of pregeometry and (...) generic elements is each time introduced. (shrink)

Let R be an o-minimal expansion of an ordered group R has no poles, R cannot define a real closed field with domain R and order R is eventually linear and every R -definable set is a finite union of cones. As a corollary we get that Th has quantifier elimination and universal axiomatization in the language with symbols for the ordered group operations, bounded R -definable sets and a symbol for each definable endomorphism of the group.

In this note we show: Let R = 〈R, <, +, 0, …〉 be a semi-bounded o-minimal expansion of an ordered group, and G a group definable in R of linear dimension m . Then G is a definable extension of a bounded definable group B by 〈Rm, +〉.

We prove that in a semi-bounded o-minimal expansion of an ordered group every non-empty open definable set is a finite union of open cells.

In this note I construct a proper o-minimal expansion of the ordered additive group of rationals.