Search arXivSearch

arXiv · 2211.08396

Surreal fields stable under exponential, logarithmic, derivative and anti-derivative functions

Abstract

The class of surreal numbers, denoted by $\textbf{No}$, initially proposed by Conway, is a universal ordered field in the sense that any ordered field can be embedded in it. They include in particular the real numbers and the ordinal numbers. They have strong relations with other fields such as field of transseries. Following Gonshor, surreal numbers can be seen as signs sequences of ordinal length, with some exponential and logarithmic functions that extend the usual functions over the reals. $\textbf{No}$ can actually be seen as an elegant (generalized) power series field with real coefficients, namely Hahn series with exponents in $\textbf{No}$ itself. Some years ago, Berarducci and Mantova considered derivation over the surreal numbers, seeing them as germs of functions, in correspondence to transseries. In this article, following our previous work, we exhibit a sufficient condition on the structure of a surreal field to be stable under all operations among exponential, logarithm, derivation and anti-derivation. Motivated, in the long term, by computability considerations, we also provide a non-trivial application of this theorem: the existence of a pretty reasonable field that only requires ordinals up to $\epsilon_\omega$, which is far smaller than $\omega_1^{CK}$ (resp. $\omega_1$), the first non-computable (resp. uncountable) ordinal.

Explore related subjects

Keep this discovery

BibTeXRIS

Olivier Bournez, Quentin Guilmant. 2022-10-25. Surreal fields stable under exponential, logarithmic, derivative and anti-derivative functions. https://arxiv.org/abs/2211.08396

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