Related papers: Contraction Elimination in Sequent Based Ground Eq…
We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this…
In two companion papers it was shown how to separate out from a scattering function in quantum electrodynamics a distinguished part that meets the correspondence-principle and pole-factorization requirements. The integrals that define the…
Chase algorithms are indispensable in the domain of knowledge base querying, which enable the extraction of implicit knowledge from a given database via applications of rules from a given ontology. Such algorithms have proved beneficial in…
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…
We prove effective Nullstellensatz and elimination theorems for difference equations in sequence rings. More precisely, we compute an explicit function of geometric quantities associated to a system of difference equations (and these…
The Gell-Mann $\lambda$ matrices for Lie algebra su(3) are the natural basis for the Hilbert space of Hermitian operators acting on the states of a three-level system(qutrit). So the construction of EWs for two-qutrit states by using these…
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…
The existence and stability of collisional kinetic equation, especially non-cutoff Boltzmann equation, in bounded domain with physical boundary condition is longstanding open problem. This work proves the global stability of the Landau…
We present a detailed analysis of QED corrections to $\bar{B} \to \bar{K} \ell^+ \ell^-$ decays at the double-differential level. Cancellations of soft and collinear divergences are demonstrated analytically using the phase space slicing…
Noncommutative differential calculus on quantum Minkowski space is not separated with respect to the standard generators, in the sense that partial derivatives of functions of a single generator can depend on all other generators. It is…
In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…
We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…
Earlier, we introduced Partial Quantifier Elimination (PQE). It is a $\mathit{generalization}$ of regular quantifier elimination where one can take a $\mathit{part}$ of the formula out of the scope of quantifiers. We apply PQE to CNF…
Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…
Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a…
In this paper, we study a special type of cutoff regularization in the coordinate representation. We show how this approach unites such concepts and properties as an explicit cut, a spectral representation, a homogenization, and a…
In this paper, we investigate proof-theoretic aspects of the logics of evidence and truth LETJ and LETF. These logics extend, respectively, Nelson's logic N and the logic of first-degree entailment FDE, also known as Belnap-Dunn four-valued…
We give examples of calculi that extend Gentzen's sequent calculus LK by unsound quantifier inferences in such a way that (i) derivations lead only to true sequents, and (ii) proofs therein are non-elementarily shorter than LK-proofs.
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…