To decide whether a propositional formula can be deduced from a finite set of formulas in a given many-valued logic system, we only need to decide whether a polynomial vanishes on an algebraic variety. By using Wu's method, we present an algorithm for this deduction problem
International audienceWe present a method for testing the validity for any finite manyvalued logic b...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
Categories and Subject Descriptors I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulat...
To decide whether a propositional formula can be deduced from a finite set of formulas in a given ma...
It is shown that a simple deduction engine can be developed for a propositional logic that follows t...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
Algebraic transition systems are extended from labeled transition systems by allowing transitions la...
We define an automatic proof procedure for finitely many-valued logics given by truth tables. The pr...
AbstractThe method for automatic theorem proving proposed in [Carnielli, W. A., Polynomial ring calc...
We present a general framework that allows to construct systematically analytic calculi for a large...
In the case of classical logic, the Stone isomorphism between Boolean Algebras and Boolean Rings is ...
In this paper a unified classification is proposed of the rules of inference of classical, modal and...
Deduction chains represent a syntactic and in a certain sense constructive method for proving comple...
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelle...
Abstract. The concept of logical fiberings is briefly summarized. Based on experiences with concrete...
International audienceWe present a method for testing the validity for any finite manyvalued logic b...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
Categories and Subject Descriptors I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulat...
To decide whether a propositional formula can be deduced from a finite set of formulas in a given ma...
It is shown that a simple deduction engine can be developed for a propositional logic that follows t...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
Algebraic transition systems are extended from labeled transition systems by allowing transitions la...
We define an automatic proof procedure for finitely many-valued logics given by truth tables. The pr...
AbstractThe method for automatic theorem proving proposed in [Carnielli, W. A., Polynomial ring calc...
We present a general framework that allows to construct systematically analytic calculi for a large...
In the case of classical logic, the Stone isomorphism between Boolean Algebras and Boolean Rings is ...
In this paper a unified classification is proposed of the rules of inference of classical, modal and...
Deduction chains represent a syntactic and in a certain sense constructive method for proving comple...
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelle...
Abstract. The concept of logical fiberings is briefly summarized. Based on experiences with concrete...
International audienceWe present a method for testing the validity for any finite manyvalued logic b...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
Categories and Subject Descriptors I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulat...
DOI
Add to ORKG