Related papers: PBNF-transform as a formulation of Propositional C…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
We study the representations of two types of pointed Hopf algebras: restricted two-parameter quantum groups, and the Drinfel'd doubles of rank one pointed Hopf algebras of nilpotent type. We study, in particular, under what conditions a…
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
We decompose a matrix Y into a sum of bilinear terms in a stepwise manner, by considering Y as a mapping from a finite dimensional Banach space into another finite dimensional Banach space. We provide transition formulas, and represent them…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…
We provide elementary proofs of several results concerning the possible outcomes arising from a fixed profile within the class of positional voting systems. Our arguments enable a simple and explicit construction of paradoxical profiles,…
Inference in probabilistic logic languages such as ProbLog, an extension of Prolog with probabilistic facts, is often based on a reduction to a propositional formula in DNF. Calculating the probability of such a formula involves the…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…
In this paper we propose a new version of differential transform method (we shall call this method as $\alpha$-parameterized differential transform method), which differs from the traditional differential transform method in calculating…
The notion of Fourier transformation is described from an algebraic perspective that lends itself to applications in Symbolic Computation. We build the algebraic structures on the basis of a given Heisenberg group (in the general sense of…
In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. We consider the functional equation $f(x)+x^k=f(x+1)$ and show that a solution can be derived from…
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…
In this paper, we are interested in the construction of a bilinear pseudodifferential calculus. We define some symbolic classes which contains those of Coifman-Meyer. These new classes allow us to consider operators closely related to the…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
We present an approach to obtain formally verified implementations of classical Computational Logic algorithms. We choose the Why3 platform because it allows to implement functions in a style very close to the mathematical definitions, as…