Given a weakly o-minimal structure${\cal M}$and its o-minimal completion$\bar{{\cal M}}$, we first associate to$\bar{{\cal M}}$a canonical language and then prove thatTh$\left$determines$Th\left$. We then investigate the theory of the pair$\left$in the spirit of the theory of dense pairs of o-minimal structures, and prove, among other results, that it is near model complete, and every definable open subset of${\bar{M}^n}$is already definable in$\bar{{\cal M}}$.We give an example of a weakly o-minimal structure interpreting$\bar{{\cal M}}$and show that it is not elementarily equivalent to any reduct (...) of an o-minimal trace. (shrink)

Continuous extension cell decomposition in o-minimal structures was introduced by Simon Andrews to establish the open cell property in those structures. Here, we define strong $\mathrm{CE}$-cells in weakly o-minimal structures, and prove that every weakly o-minimal structure with strong cell decomposition has $\mathrm{SCE}$-cell decomposition if and only if its canonical o-minimal extension has $\mathrm{CE}$-cell decomposition. Then, we show that every weakly o-minimal structure with $\mathrm{SCE}$-cell decomposition satisfies $\mathrm{OCP}$. Our last result implies that every o-minimal structure in which every definable open (...) set is a union of finitely many open $\mathrm{CE}$-cells, has $\mathrm{CE}$-cell decomposition. (shrink)

We prove that all known examples of weakly o-minimal nonvaluational structures have no definable Skolem functions. We show, however, that such structures eliminate imaginaries up to definable families of cuts. Along the way we give some new examples of weakly o-minimal nonvaluational structures.

Let $$ {\mathcal {M}}=(M, <, \ldots ) $$ be a weakly o-minimal structure. Assume that $$ {\mathcal {D}}ef({\mathcal {M}})$$ is the collection of all definable sets of $$ {\mathcal {M}} $$ and for any $$ m\in {\mathbb {N}} $$, $$ {\mathcal {D}}ef_m({\mathcal {M}}) $$ is the collection of all definable subsets of $$ M^m $$ in $$ {\mathcal {M}} $$. We show that the structure $$ {\mathcal {M}} $$ has the strong cell decomposition property if and only if there is (...) an o-minimal structure $$ {\mathcal {N}} $$ such that $$ {\mathcal {D}}ef({\mathcal {M}})=\{Y\cap M^m: \ m\in {\mathbb {N}}, Y\in {\mathcal {D}}ef_m({\mathcal {N}})\} $$. Using this result, we prove that: (a) Every induced structure has the strong cell decomposition property. (b) The structure $$ {\mathcal {M}} $$ has the strong cell decomposition property if and only if the weakly o-minimal structure $$ {\mathcal {M}}^*_M $$ has the strong cell decomposition property. Also we examine some properties of non-valuational weakly o-minimal structures in the context of weakly o-minimal structures admitting the strong cell decomposition property. (shrink)

Strong cell decomposition property has been proved in non-valuational weakly o-minimal expansions of ordered groups. In this note, we show that all o-minimal traces have strong cell decomposition property. Also after introducing the notion of irrational nonvaluational cut in arbitrary o-minimal structures, we show that every expansion of o-minimal structures by irrational nonvaluational cuts is an o-minimal trace.

A box type is an n-type of an o-minimal structure which is uniquely determined by the projections to the coordinate axes. We characterize heirs of box types of a polynomially bounded o-minimal structure M. From this, we deduce various structure theorems for subsets of $M^k $ , definable in the expansion M of M by all convex subsets of the line. We show that M after naming constants, is model complete provided M is model complete.

Given a group , G⊆Mm, definable in a first-order structure equation image equipped with a dimension function and a topology satisfying certain natural conditions, we find a large open definable subset V⊆G and define a new topology τ on G with which becomes a topological group. Moreover, τ restricted to V coincides with the topology of V inherited from Mm. Likewise we topologize transitive group actions and fields definable in equation image. These results require a series of preparatory facts concerning (...) dimension functions, some of which might be of independent interest. (shrink)

Let M=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}=}$$\end{document} be a weakly o-minimal expansion of a dense linear order without endpoints. Some tame properties of sets and functions definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} which hold in o-minimal structures, are examined. One of them is the intermediate value property, say IVP. It is shown that strongly continuous definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} satisfy an extended (...) version of IVP. After introducing a weak version of definable connectedness in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document}, we prove that strong cells in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} are weakly definably connected, so every set definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} is a finite union of its weakly definably connected components, provided that M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} has the strong cell decomposition property. Then, we consider a local continuity property for definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} and conclude some results on cell decomposition regarding that property. Finally, we extend the notion of having no dense graph which was examined for definable functions in and related to uniform finiteness, definable completeness, and others. We show that every weakly o-minimal structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} having cell decomposition, satisfies NDG, i.e. every definable function in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} has no dense graph. (shrink)

In o-minimal structures, every cell is definably connected and every definable set is a finite union of its definably connected components. In this note, we introduce pseudo definably connected definable sets in weakly o-minimal structures having strong cell decomposition, and prove that every strong cell in those structures is pseudo definably connected. It follows that every definable set can be written as a finite union of its pseudo definably connected components. We also show that the projections of pseudo definably connected (...) definable sets are pseudo definably connected. Finally, we compare pseudo definable connectedness with weak definable connectedness of definable sets in weakly o-minimal structures. (shrink)

Let be a weakly o‐minimal structure with the strong cell decomposition property. In this note, we show that the canonical o‐minimal extension of is the unique prime model of the full first order theory of over any set. We also show that if two weakly o‐minimal structures with the strong cell decomposition property are isomorphic then, their canonical o‐minimal extensions are isomorphic too. Finally, we show the uniqueness of the prime models in a complete weakly o‐minimal theory with prime models.

Given an o-minimal structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal M}$$\end{document} with a group operation, we show that for a properly convex subset U, the theory of the expanded structure M′=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal M}'=$$\end{document} has definable Skolem functions precisely when M′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal M}'$$\end{document} is valuational. As a corollary, we get an elementary proof that the theory of any such M′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} (...) \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal M}'$$\end{document} does not satisfy definable choice. (shrink)