Related papers: The Epsilon Calculus with Equality and Herbrand Co…
We introduce the notion of $\epsilon$-irreducibility for arithmetic cycles meaning that the degree of its analytic part is small compared to the degree of its irreducible classical part. We will show that for every $\epsilon>0$ any…
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…
We present Epsilon, a system for general convex programming using fast linear and proximal operators. As with existing convex programming frameworks, users specify convex optimization problems using a natural grammar for mathematical…
By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…
The Heisenberg uncertainty relation is known to be obtainable by a purely mathematical argument. Based on that fact, here it is shown that the Heisenberg uncertainty relation remains valid when Quantum Mechanics is re-formulated within far…
We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus…
In this paper, we introduce a new concept, namely $\epsilon$-arithmetics, for real vectors of any fixed dimension. The basic idea is to use vectors of rational values (called rational vectors) to approximate vectors of real values of the…
In this paper we use the viewpoint of the formal calculus underlying vertex operator algebra theory to study certain aspects of the classical umbral calculus and we introduce and study certain operators generalizing the classical umbral…
Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…
The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of…
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…
Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifiers by introducing new function symbols, enabling efficient…
A statistical functional, such as the mean or the median, is called elicitable if there is a scoring function or loss function such that the correct forecast of the functional is the unique minimizer of the expected score. Such scoring…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
This paper shows the equivalence of the Riemann hypothesis to an sequence of elementary inequalities involving the harmonic numbers H_n, the sum of the reciprocals of the integers from 1 to n. It is a modification of a criterion due to Guy…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and combinatorics. We try to expose the motivations that led Hilbert…
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
One-loop counterterms are computed in the first order formalism for the Einstein-Hilbert action with a minimally coupled scalar field using the background field method and the heat kernel technique. The {\em off-shell} divergent piece in…