Related papers: Implicational Propositional Calculus: Tableaux and…
Tables are an extremely powerful visual and interactive tool for structuring and manipulating data, making spreadsheet programs one of the most popular computer applications. In this paper we introduce and address the task of recommending…
We present a simple theory explaining the construction and the correctness of an incremental and worst-case optimal decision procedure for modal logic with eventualities. The procedure gives an abstract account of important aspects of…
In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…
This document is a companion for the Maple program \textbf{Summing a polynomial function over integral points of a polygon}. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We give a comprehensive account on the parameterized complexity of model checking and satisfiability of propositional inclusion and independence logic. We discover that for most parameterizations the problems are either in FPT or…
This paper aims to introduce the concept of nilpotency and capability in multiplicative Lie algebras. Also, we see the existence of covers of a multiplicative Lie algebra and thoroughly examine their relationships with capable and perfect…
The do-calculus is a well-known deductive system for deriving connections between interventional and observed distributions, and has been proven complete for a number of important identifiability problems in causal inference. Nevertheless,…
We study the interpolation group whose elements are suitable pairs of formal power series. This group has a faithful representation into infinite lower triangular matrices and carries thus a natural structure as a Lie group. The matrix…
We present an incomplete proof synthesis method for the Calculus of Constructions which is always terminating and a complete Vernacular for the Calculus of Constructions based on this method.
This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…
In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a proof-theoretic soundness and completeness proof, which we…
In this paper, an application of automated theorem proving techniques to computational semantics is considered. In order to compute the presuppositions of a natural language discourse, several inference tasks arise. Instead of treating…
This article presents a class of modified new modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). By using two positive diagonal matrices, we formulate a fixed-point equation which is…
In this paper we investigate the general combinatorical structure of the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication, an m-implication.
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
We prove the determinant connectivity matrix formula. Mathematically, the proof introduces novel techniques based on an algebraic approach and connectivity properties. Although this is the second part of a previous paper and has its…