Repository | Journal | Volume | Articles
(2006) Synthese 149 (2).
On the computational consequences of independence in propositional logic
Merlijn Sevenster
pp. 257-283
Sandu and Pietarinen [Partiality and Games: Propositional Logic. Logic J. IGPL 9 (2001) 101] study independence friendly propositional logics. That is, traditional propositional logic extended by means of syntax that allow connectives to be independent of each other, although the one may be subordinate to the other. Sandu and Pietarinen observe that the IF propositional logics have exotic properties, like functional completeness for three-valued functions. In this paper we focus on one of their IF propositional logics and study its properties, by means of notions from computational complexity. This approach enables us to compare propositional logic before and after the IF make-over. We observe that all but one of the best-known decision problems experience a complexity jump, provided that the complexity classes at hand are not equal. Our results concern every discipline that incorporates some notion of independence such as computer science, natural language semantics, and game theory. A corollary of one of our theorems illustrates this claim with respect to the latter discipline.
Publication details
DOI: 10.1007/s11229-005-3878-5
Full citation:
Sevenster, M. (2006). On the computational consequences of independence in propositional logic. Synthese 149 (2), pp. 257-283.
This document is unfortunately not available for download at the moment.