SearcharxivSearch

arXiv · 2201.08199

Surreal fields stable under exponential and logarithmic functions

Abstract

Surreal numbers, have a very rich and elegant theory. This class of numbers, denoted by No, includes simultaneously the ordinal numbers and the real numbers, and forms a universal huge real closed field: It is universal in the sense that any real closed field can be embedded in it. Following Gonshor, surreal numbers can also be seen as signs sequences of ordinal length, with some exponential and logarithmic functions that extend the usual functions over the reals. No can actually also be seen as an elegant particular (generalized) power series field with real coefficients, namely Hahn series with exponents in No itself. It can also be considered as a particular field of transseries, providing tools to do some analysis and asymptotic analysis for functions over the continuum, providing natural concepts for discussing hyperexponential or sublogarithm functions, and their asymptotics. In this article, we consider stability of subfields of No under exponential and logarithmic functions. Namely, we consider the set surreal numbers whose signs sequences have length less than some ordinal {\lambda}. Extending the discussion from van den Dries and Ehrlich, we show that is stable by exponential and logarithm iff {\lambda} is some {\epsilon}-number. Motivated in a longer term by computability issues using ordinal machines, we consider subfields stables by exponential and logarithmic functions defined by Hahn series that does not require to go up to cardinal lengths and exponents. We prove that No can be expressed as a strict hierarchy of subfields stable by exponential and logarithmic functions. This provides many explicit examples of subfields of No stable by exponential and logarithmic functions, and does not require to go up to a cardinal {\lambda} to provide such examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Olivier Bournez, Quentin Guilmant. 2022-01-20. Surreal fields stable under exponential and logarithmic functions. https://arxiv.org/abs/2201.08199

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