2000 character limit reached
Tame Topology over Dp-minimal Structures
Published 28 Sep 2015 in math.LO | (1509.08484v2)
Abstract: 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 functions". This generalizes known statements about weakly o-minimal, C-minimal and P-minimal theories.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.