On the complexity of propositional logics with an involutive negation

14 years 11 months ago

Download www.eusflat.org

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á

Real-time Traffic

EUSFLAT 2003 | EUSFLAT 2007 | Involutive Negation | Propositional Calculus |

claim paper

» Glivenko theorems for substructural logics over FL

» tascpl TAS Solver for Classical Propositional Logic

» The complexity of satisfiability for fragments of hybrid logic Part I

» Polynomial certificates for propositional classes

» The Complexity of Closed World Reasoning and Circumscription

» Complexity of Strict Implication

» Computational Complexity of Constraint Satisfaction

» Nonmonotonic Reasoning Preferential Models and Cumulative Logics

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	EUSFLAT
Authors	Zuzana Haniková

Comments (0)

Sciweavers

On the complexity of propositional logics with an involutive negation

EUSFLAT 2003 | EUSFLAT 2007 | Involutive Negation | Propositional Calculus |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers