In this article, 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 “multivalued functions.” This generalizes known statements about weakly o-minimal, C-minimal, and P-minimal theories.
"Tame Topology over dp-Minimal Structures." Notre Dame J. Formal Logic 60 (1) 61 - 76, 2019. https://doi.org/10.1215/00294527-2018-0019