SearcharxivSearch

arXiv · 2407.07442

Truncations in languages of generalized power series and the structure of $T$-$\lambda$-spherical completions of o-minimal fields

Abstract

Let $T$ be the theory of an o-minimal field and $T_0$ a common reduct of $T$ and $T_{an}$. I adapt Mourgues' and Ressayre's constructions to deduce structure results for $T_0$-reducts of $T$-$\lambda$-spherical completion of models of $T_{\mathrm{convex}}$. These in particular entail that whenever $T$ is the theory of a reduct of $\mathbb{R}_{an,\exp}$ defining the exponentiation (e.g.\ $T=T_{\exp}$, the theory of the field of reals expanded by the exponential function), every model of $T$ has an initial elementary embedding in the field $\mathbf{No}$ of surreal numbers. This answers positively an open question in (arXiv:2002.07739). The main technical result is that expanding an integral domain of generalized series in the sense of Hahn-Higman-Ribenboim (such as a Hahn field) by a family of generalized power series interpreted as functions defined on certain infinitesimal elements, has the property that truncation closed subsets generate truncation closed substructures, provided that the family of generalized power series is itself closed under truncations and partial derivatives. It is also shown that the further closure of the generated set under solutions to certain equations is as well closed under truncations. The formal results on power series leave room for possible generalizations to the case in which $T_0$ is power bounded but not necessarily a reduct of $T_{an}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Freni. 2024-07-10. Truncations in languages of generalized power series and the structure of $T$-$\lambda$-spherical completions of o-minimal fields. https://arxiv.org/abs/2407.07442

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