Sciweavers

APAL
2006
107views more  APAL 2006»
14 years 15 days 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
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
14 years 1 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á
RELMICS
2000
Springer
14 years 4 months ago
A Decision Method for Duration Calculus
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
Nathalie Chetcuti-Sperandio, Luis Fariñas d...
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
14 years 4 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