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  is coNP-complete.

• Type: Conference
• Year: 2003
• Where: EUSFLAT
• Authors: Zuzana Haniková
• Keywords: EUSFLAT 2003, EUSFLAT 2007, Involutive Negation, Propositional Calculus