Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1803.00598

Logarithms, constructible functions and integration on non-archimedean models of the theory of the real field with restricted analytic functions with value group of finite archimedean rank

Tobias Kaiser
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a model of the theory of the real field with restricted analytic functions such that its value group has finite archimedean rank we show how one can extend the restricted logarithm to a global logarithm with values in the polynomial ring over the model with dimension the archimedean rank. The logarithms are determined by algebraic data from the model, namely by a section of the model and by an embedding of the value group into its Hahn group. If the archimedean rank of the value group coincides with the rational rank the logarithms are equivalent. We illustrate how one can embed such a logarithm into a model of the real field with restricted analytic functions and exponentiation. This allows us to define constructible functions with good lifting properties. As an application we establish a Lebesgue measure and integration theory with values in the polynomial ring, extending and strengthening the construction in [T. Kaiser: Lebesgue measure and integration theory on non-archimedean real closed fields with archimedean value group. Proc. Lond. Math. Soc. 116 (2018), no. 2, 209-247.].

Explore related subjects

math.LOmath.CAmath.CV

Keep this discovery

BibTeXRIS

Tobias Kaiser. 2018-03-01. Logarithms, constructible functions and integration on non-archimedean models of the theory of the real field with restricted analytic functions with value group of finite archimedean rank. https://arxiv.org/abs/1803.00598

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗