Related papers: The Epsilon Calculus and Herbrand Complexity
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
We show how one can construct a differential calculus over an algebra where position variables x and momentum variables p have be defined. As the simplest example we consider the one-dimensional q-deformed Heisenberg algebra. This algebra…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We introduce a method to derive theorems from Elementary Number Theory by means of relationships among formal languages. Using $\sigma$-algebras, we define what a proof of a number-theoretical statement by Language Theory means. We prove…
We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Gr\"adel and Tannen. We characterize the complexity of model checking and data complexity of first-order…
This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…
Despite the impressive success of quantum structures to model long-standing human judgement and decision puzzles, the {\it quantum cognition research programme} still faces challenges about its explanatory power. Indeed, quantum models…
Our basic structure is a finite-dimensional complex Hilbert space $H$. We point out that the set of effects on $H$ form a convex effect algebra. Although the set of operators on $H$ also form a convex effect algebra, they have a more…
The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Formal proofs in the sequent calculus are finite trees obtained…
We revise the construction of creation/annihilation operators in quantum mechanics based on the representation theory of the Heisenberg and symplectic groups. Besides the standard harmonic oscillator (the elliptic case) we similarly treat…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
We describe a method for the rapid numerical evaluation of the Bessel functions of the first and second kinds of nonnegative real orders and positive arguments. Our algorithm makes use of the well-known observation that although the Bessel…
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…
Useful relations describing arbitrary parameters of given quantum systems can be derived from simple physical constraints imposed on the vectors in the corresponding Hilbert space. This is well known and it usually proceeds by partitioning…
For relational monadic formulas (the L\"owenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting - operations that currently receive much attention in…
Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…