We explore analogues of o-minimality and weak o-minimality for circularly ordered sets. Much of the theory goes through almost unchanged, since over a parameter the circular order yields a definable linear order. Working over ∅ there are differences. Our main result is a structure theory for ℵ0-categorical weakly circularly minimal structures. There is a 5-homogeneous example which is not 6-homogeneous, but any example which is k-homogeneous for some k ≥ 6 is k-homogeneous for all k.

A weakly o-minimal structure image expanding an ordered group is called nonvaluational iff for every cut left angle bracketC,Dright-pointing angle bracket of definable in image, we have that inf{y−x:xset membership, variantC,yset membership, variantD}=0. The study of nonvaluational weakly o-minimal expansions of real closed fields carried out in [D. Macpherson, D. Marker, C. Steinhorn,Weakly o-minimal structures and real closed fields, Trans. Amer. Math. Soc. 352 5435–5483. MR1781273 (2001i:03079] suggests that this class is very close to the class of o-minimal expansions of (...) real closed fields. Here we further develop this analogy. We establish an o-minimal style cell decomposition for weakly o-minimal non-valuational expansions of ordered groups. For structures enjoying such a strong cell decomposition we construct a canonical o-minimal extension. Finally, we make attempts towards generalizing the o-minimal Euler characteristic to the class of sets definable in weakly o-minimal structures with the strong cell decomposition property. (shrink)

Orthogonality of all families of pairwise weakly orthogonal 1-types for ℵ0-categorical weakly o-minimal theories of finite convexity rank has been proved in 6. Here we prove orthogonality of all such families for binary 1-types in an arbitrary ℵ0-categorical weakly o-minimal theory and give an extended criterion for binarity of ℵ0-categorical weakly o-minimal theories . © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization of linearity (...) for SU-rank 1 structures by giving several equivalent conditions on T*, find a “weak” version of local modularity which is equivalent to linearity, show that linearity coincides with 1-basedness, and use the generic pairs to “recover” projective geometries over division rings from non-trivial linear SU-rank 1 structures. (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)