Sciweavers

100 search results - page 2 / 20
» A Schemata Calculus for Propositional Logic
Sort
View
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
13 years 10 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
CADE
2008
Springer
13 years 8 months ago
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
13 years 7 months ago
On the complexity of propositional logics with an involutive negation
Let C be the propositional calculus given by a standard SBL-algebra; C  is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C  i...
Zuzana Haniková
APAL
2006
107views more  APAL 2006»
13 years 6 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek
BSL
2006
114views more  BSL 2006»
13 years 6 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran