Search arXivSearch

arXiv · 2104.01312

Almost o-minimal structures and $\mathfrak X$-structures

Abstract

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open interval is a finite union of points and open intervals. The latter is a variant of van den Dries and Miller's analytic geometric categories and Shiota's $\mathfrak X$-sets and $\mathfrak Y$-sets. In them, the family of definable sets are closed only under proper projections unlike first-order structures. We demonstrate that an $\mathfrak X$-expansion of an ordered divisible abelian group always contains an o-minimal expansion of an ordered group such that all bounded $\mathfrak X$-definable sets are definable in the structure. Another contribution of this paper is a uniform local definable cell decomposition theorem for almost o-minimal expansions of ordered groups $\mathcal M=(M,<,0,+,\ldots)$. Let $\{A_\lambda\}_{\lambda\in\Lambda}$ be a finite family of definable subsets of $M^{m+n}$. Take an arbitrary positive element $R \in M$ and set $B=]-R,R[^n$. Then, there exists a finite partition into definable sets \begin{equation*} M^m \times B = X_1 \cup \ldots \cup X_k \end{equation*} such that $B=(X_1)_b \cup \ldots \cup (X_k)_b$ is a definable cell decomposition of $B$ for any $b \in M^m$ and either $X_i \cap A_\lambda = \emptyset$ or $X_i \subseteq A_\lambda$ for any $1 \leq i \leq k$ and $\lambda \in \Lambda$. Here, the notation $S_b$ denotes the fiber of a definable subset $S$ of $M^{m+n}$ at $b \in M^m$. We introduce the notion of multi-cells and demonstrate that any definable set is a finite union of multi-cells in the course of the proof of the above theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Masato Fujita. 2021-04-03. Almost o-minimal structures and $\mathfrak X$-structures. https://doi.org/10.1016/j.apal.2022.103144

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