APAL
2006
13 years 4 months ago
2006
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...
EUSFLAT
2003
13 years 6 months ago
2003
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...
RELMICS
2000
Springer
13 years 8 months ago
2000
Springer
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 ...
ISMVL
1994
IEEE
13 years 8 months ago
1994
IEEE
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...