论文信息 - On the complexity of propositional logics with an involutive negation

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.

Zuzana Haniková | Z. Haniková

[1] Petr Hájek,et al. Basic fuzzy logic and BL-algebras II , 1998, Soft Comput..

[2] Helmut Veith,et al. Complexity of t-tautologies , 2001, Ann. Pure Appl. Log..

[3] Petr Hájek,et al. Basic fuzzy logic and BL-algebras , 1998, Soft Comput..

[4] Lluis Godo,et al. Basic Fuzzy Logic is the logic of continuous t-norms and their residua , 2000, Soft Comput..

[5] Franco Montagna,et al. Equational Characterization of the Subvarieties of BL Generated by t-norm Algebras , 2004, Stud Logica.

[6] P. Mostert,et al. On the Structure of Semigroups on a Compact Manifold With Boundary , 1957 .

[7] Petr Hájek,et al. Metamathematics of Fuzzy Logic , 1998, Trends in Logic.