Search arXivSearch

arXiv · 2002.07739

Surreal ordered exponential fields

Abstract

In [26], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway's ordered field $\mathbf{No}$ of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered field (ordered $K$-vector space) to be isomorphic to an initial subfield ($K$-subspace) of $\mathbf{No}$, i.e. a subfield ($K$-subspace) of $\mathbf{No}$ that is an initial subtree of $\mathbf{No}$. In this sequel to [15], piggybacking on the just-said results, analogous results are established for ordered exponential fields, making use of a slight generalization of Schmeling's conception of a transseries field. It is further shown that a wide range of ordered exponential fields are isomorphic to initial exponential subfields of $(\mathbf{No}, \exp)$. These include all models of $T(\mathbb{R}_W, e^x)$, where $\mathbb{R}_W$ is the reals expanded by a convergent Weierstrass system $W$. Of these, those we call trigonometric-exponential fields are given particular attention. It is shown that the exponential functions on the initial trigonometric-exponential subfields of $\mathbf{No}$, which includes $\mathbf{No}$ itself, extend to canonical exponential functions on their surcomplex counterparts. The image of the canonical map of the ordered exponential field $\mathbb{T}^{LE}$ of logarithmic-exponential transseries into $\mathbf{No}$ is shown to be initial, as are the ordered exponential fields $\mathbb{R}((\omega))^{EL}$ and $\mathbb{R}\langle\langle\omega\rangle \rangle$.

Explore related subjects

Keep this discovery

BibTeXRIS

Philip Ehrlich, Elliot Kaplan. 2020-02-18. Surreal ordered exponential fields. https://arxiv.org/abs/2002.07739

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