Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Barwise (1979) ArticleTitle‘On Branching Quantifiers in English’ Journal of Philosophical Logic 8 47–80 Occurrence Handle10.1007/BF00258419
A. Blass Y. Gurevich (1986) ArticleTitle‘Henkin Quantifiers and Complete Problems’ Annals of Pure and Applied Logic 32 1–16 Occurrence Handle10.1016/0168-0072(86)90040-0
J. C. Bradfield S. B. Fröschle (2002) ArticleTitle‘Independence-Friendly Modal Logic and True Concurrency’ Nordic Journal of Computing 9 IssueID2 102–117
Dechesne, F.: 2005, Game, Set, Maths: Formal Investigations into Logic with Imperfect Information, Ph.D. thesis, SOBU, Tilburg university and Technische Universiteit Eindhoven.
Fagin, R.: 1974, ‘Generalized First-order Spectra and Polynomial-Time Recognizable Sets’, in R. M. Karp (eds.), SIAM-AMS Proceedings, Complexity of Computation, Vol. 7, pp. 43–73.
M. Garey D. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-completeness W. H. Freeman and Company San Francisco
L. Henkin (1961) ‘Some Remarks on Infinitely Long Formulas’ P. Bernays (Eds) Infinitistic Methods. Proceedings of the Symposium on Foundations of Mathematics Pergamon Press and PWN Oxford and Warsaw 167–183
J. Hintikka (1996) Principles of Mathematics Revisited Cambridge University Press Cambridge
J. Hintikka G. Sandu (1997) ‘Game-Theoretical Semantics’ J.F.A.K. Benthem Particlevan A. ter Meulen (Eds) Handbook of Logic and Language North Holland Amsterdam 361–481
W. Hodges (2001) ArticleTitle‘Formal Aspects of Compositionality’ Journal of Logic, Language and Information 10 7–28 Occurrence Handle10.1023/A:1026502210492
H. Kleine Büning T. Lettman (1999) Propositional Logic: Deduction and Algo- rithms, Vol. 48 of Cambridge Tracts in Theoretical Computer Science Cambridge University Press Cambridge
D. Koller N. Megiddo (1992) ArticleTitle‘The complexity of two-person zero-sum games in extensive form’ Games and Economic Behavior 4 528–552 Occurrence Handle10.1016/0899-8256(92)90035-Q
Osborne, M. J. and A. Rubinstein: 1994, A Course in Game Theory, MIT Press.
C.H. Papadimitriou (1994) Computational Complexity Addison-Wesley Reading, Massachusetts
G. Peterson S. Azhar J. Reif (2001) ArticleTitle‘Lower Bounds for Multiplayer Nonco-operative Games of Incomplete Information’ Computers and Mathematics with Applications 41 957–992 Occurrence Handle10.1016/S0898-1221(00)00333-3
G. Sandu J. Hintikka (2001) ArticleTitle‘Aspects of Compositionality’ Journal of Logic, Language and Information 10 49–61 Occurrence Handle10.1023/A:1026530709583
G. Sandu A. Pietarinen (2001) ArticleTitle‘Partiality and Games: Propositional Logic’ Logic Journal of the IGPL 9 IssueID1 101–121
Sandu, G. and A. Pietarinen: 2003, ‘Informationally Independent Connectives’, in G. Mints and R. Muskens (eds.), Games, Logic, and Constructive Sets, CSLI Publications, pp. 23–41.
Sevenster, M.: 2005, ‘A Computational Universal for Generalized Quantifiers in Natural Language’, Manuscript.
T. Tulenheimo (2004) Independence-Friendly Modal Logic University of Helsinki Finland
van Benthem, J. F. A. K.: 2000, Logic and Games, Lecture Notes, Draft version.
van Emde Boas, P.: 2003, ‘Games, Complexity and Interaction: The role of games in computer science’, in H. Kilov and K. Baclawski (eds.), Practical Foundations of Business System Specifications, Kluwer Academic Publishers, pp. 313–327.
W. Walkoe (1970) ArticleTitle‘Finite Partially-Ordered Quantification’ Journal of Symbolic Logic 35 535–555
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sevenster, M. On The Computational Consequences of Independence in Propositional Logic. Synthese 149, 257–283 (2006). https://doi.org/10.1007/s11229-005-3878-5
Issue Date:
DOI: https://doi.org/10.1007/s11229-005-3878-5