SearcharxivSearch

arXiv · 2510.26248

Integration in finite terms and exponentially algebraic functions

Abstract

We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that is, a holomorphic solution which is definable in the structure of restricted elementary functions? Do solutions of a given list of algebraic differential equations share a nontrivial exponentially algebraic relation, that is, a nontrivial relation definable in the structure of restricted elementary functions? These problems can be traced back to the work of Abel and Liouville on the problem of integration in finite terms. This article concerns generalizations of their techniques adapted to the study of exponential transcendence and independence problems for more general systems of differential equations. As concrete applications, we obtain exponential transcendence and independence statements for several classical functions: the error function, the Bessel functions, indefinite integrals of algebraic expressions involving Lambert's W-function, the equation of the pendulum, as well as corresponding decidability results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rémi Jaoui, Jonathan Kirby. 2025-10-30. Integration in finite terms and exponentially algebraic functions. https://arxiv.org/abs/2510.26248

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