Related papers: Early Transcendental Analysis
We introduce a lightweight and accessible approach to computation over the real numbers, with the aim of clarifying both the underlying concepts and their relevance in modern research. The material is intended for a broad audience,…
We present a new formulation of the Einstein equations that casts them in an explicitly first order, flux-conservative, hyperbolic form. We show that this now can be done for a wide class of time slicing conditions, including maximal…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…
First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…
Logic has its origins in basic questions about the nature of the real world and how we describe it. This article seeks to bring out the physical and epistemological relevance of some of the more recent technical work in logic and…
Extremal length is a classical tool in 1-dimensional complex analysis for building conformal invariants. We propose a higher-dimensional generalization for complex manifolds and provide some ideas on how to estimate and calculate it. We…
SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far. However, in the context of program verification, polynomials…
We give an introduction to the transalgebraic theory of simply connected log-Riemann surfaces with a finite number of infinite ramification points (transalgebraic curves of genus $0$). We define the base vector space of transcendental…
Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar…
Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial…
We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…
Valuation based systems verifying an idempotent property are studied. A partial order is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valuations: as infimum of…
The note is devoted to estimates for convolutions appearing in some class of stochastic Volterra equations. Two maximal inequalities and exponential tail estimate are proved by the fractional method of infinite dimensional stochastic…
The aim of this paper is to exhibit a method for proving that certain analytic functions are not solutions of algebraic differential equations. The method is based on model-theoretic properties of differential fields and properties of…
We apply a framework developed by C. S. Peirce to analyze the concept of clarity, so as to examine a pair of rival mathematical approaches to a typical result in analysis. Namely, we compare an intuitionist and an infinitesimal approaches…
We give the first transcendence results for the Rosen continued fractions. Introduced over half a century ago, these fractions expand real numbers in terms of certain algebraic numbers.