arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08484math.LO
收藏

DP-极小结构上的Tame拓扑

Tame Topology over Dp-minimal Structures

Pierre Simon, Erik Walsberg

摘要:

我们发展驯服拓扑的dp-极小结构配备可定义的一致性满足一定的假设。我们的假设足以确保可定义集是驯服的:有一个很好的概念,可定义集的维数,可定义函数是几乎处处连续的,可定义集是可定义连续的“多值函数”的图形的有限并集。这推广了关于弱o-极小、C-极小和P-极小理论的已知陈述。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑