SearcharxivSearch

arXiv · 2110.15613

Tameness of definably complete locally o-minimal structures and definable bounded multiplication

Abstract

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and decomposition theorem into good-shaped definable subsets called quasi-special submanifolds. Using this fact, in the latter part of this paper, we investigate definably complete locally o-minimal expansions of ordered groups when the restriction of multiplication to an arbitrary bounded open box is definable. Similarly to o-minimal expansions of ordered fields, {\L}ojasiewicz's inequality, Tietze extension theorem and affiness of psudo-definable spaces hold true for such structures under the extra assumption that the domains of definition and the psudo-definable spaces are definably compact. Here, a pseudo-definable space is a topological spaces having finite definable atlases. We also demonstrate Michael's selection theorem for definable set-valued functions with definably compact domains of definition.

Explore related subjects

Keep this discovery

BibTeXRIS

Masato Fujita, Tomohiro Kawakami, Wataru Komine. 2021-10-29. Tameness of definably complete locally o-minimal structures and definable bounded multiplication. https://doi.org/10.1002/malq.202200004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO