12 search results - page 1 / 3 » On the complexity of propositional logics with an involutive... |
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...
FSS
2006
13 years 4 months ago
2006
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general comple...
JSYML
2006
13 years 4 months ago
2006
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
JELIA
2004
Springer
13 years 10 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
JAPLL
2010
12 years 11 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...