Related papers: Infinitesimals without Logic
We show how to convert divergent series, which typically occur in many applications in physics, into rapidly convergent inverse factorial series. This can be interpreted physically as a novel resummation of perturbative series. Being…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
This paper develops a framework of algebra whereby every Diophantine equation is made quickly accessible by a study of the corresponding row entries in an array of numbers which we call the Newtonian triangles. We then apply this framework…
We present a characterization of the completeness of the field of real numbers in the form of a \emph{collection of ten equivalent statements} borrowed from algebra, real analysis, general topology and non-standard analysis. We also discuss…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
We show that in supersymmetric theories, knowing the soft theorem for a single particle in a supermultiplet allows one to immediately determine soft theorems for the remainder of the supermultiplet. While soft theorems in supersymmetric…
Integration is the final key step when turning an infinitesimal argument into a result applicable to quantities of finite size. Conceptually, it is about combining infinitesimal contributions to a finite whole. We make a first step towards…
Sufficient conditions are given for a hard implicit function theorem to hold. The result is established by an application of the Dynamical Systems Method (DSM). It allows one to solve a class of nonlinear operator equations in the case when…
A brief survey of some basic ideas of the so-called Idempotent Mathematics is presented; an "idempotent" version of the representation theory is discussed. The Idempotent Mathematics can be treated as a result of a dequantization of the…
Let $\mathfrak{g}$ be a real finite-dimensional Lie algebra equipped with a symmetric bilinear form $\langle\cdot,\cdot\rangle$. We assume that $\langle\cdot,\cdot\rangle $ is nil-invariant. This means that every nilpotent operator in the…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
The statistical mechanics of nonrelativistic fermions in a constant magnetic field is considered from the quantum field theory point of view. The fermionic determinant is computed using a general procedure that contains all possible…
This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…
We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…
In a seminal paper, Choquet introduced an integral formula to extend a monotone increasing setfunction on a sigma-algebra to a (nonlinear) functional on bounded measurable functions. The most important special case is when the setfunction…
The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…
We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…