On the formal semantics of IF-like logics. (English) Zbl 1197.03028

Summary: In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges’ slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics.


03B60 Other nonclassical logic
Full Text: DOI Link


[1] Hintikka, J., The Principles of Mathematics Revisited (1996), Cambridge University Press · Zbl 0869.03003
[2] Hintikka, J.; Sandu, G., Game-theoretical semantics, (van Benthem, J.; ter Meulen, A., Handbook of Logic and Language (1997), The MIT Press), Ch. 6
[3] Henkin, L., Some remarks on infinitely long formulas, (Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics (1961), Pergamon Press), 167-183 · Zbl 0121.25308
[4] Walkoe, W., Finite partially-ordered quantification, J. Symbolic Logic, 35, 4, 535-555 (1970) · Zbl 0219.02008
[5] Enderton, H., Finite partially ordered quantifiers, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 16, 393-397 (1970) · Zbl 0193.29405
[6] Barwise, J., On branching quantifiers in English, J. Philos. Logic, 8, 47-80 (1979) · Zbl 0399.03008
[7] Sandu, G., On the logic of informational independence and its applications, J. Philos. Logic, 22, 1, 29-60 (1993) · Zbl 0764.03009
[8] Väänänen, J. A., Second-order logic and foundations of mathematics, Bull. Symbolic Logic, 7, 4, 504-520 (2001) · Zbl 1002.03013
[9] Hodges, W., Compositional semantics for a language of imperfect information, Log. J. IGPL, 5, 4, 539-563 (1997) · Zbl 0945.03034
[10] Janssen, T. M.V., Independent choices and the interpretation of IF logic, J. Logic Lang. Inform., 11, 3, 367-387 (2002) · Zbl 1003.03025
[11] Hodges, W., Logics of imperfect information: Why sets of assignments?, (Proceedings of the 7th Augustus de Morgan Workshop “Interactive Logic: Games and Social Software” (2005)) · Zbl 1203.03036
[12] Hodges, W., Some strange quantifiers, (Mycielski, J.; Rozenberg, G.; Salomaa, A., Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht. Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht, Lecture Notes in Computer Science, vol. 1261 (1997), Springer), 51-65 · Zbl 0883.03022
[14] Janssen, T. M.V.; Dechesne, F., Signalling in IF games: a tricky business, (The Age of Alternative Logics (2006), Springer), 221-241, Ch. 15 · Zbl 1121.03037
[15] Caicedo, X.; Krynicki, M., Quantifiers for reasoning with imperfect information and \(\Sigma_1^1\)-logic, Contemp. Math., 235, 17-31 (1999) · Zbl 0935.03048
[16] Caicedo, X.; Dechesne, F.; Janssen, T. M., Equivalence and quantifier rules for logic with imperfect information, Log. J. IGPL, 17, 1, 91-129 (2009) · Zbl 1160.03007
[17] de Bruijn, N. G., Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the Church-Rosser theorem, Indag. Math., 34, 381-392 (1972) · Zbl 0253.68007
[18] Barendregt, H., The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, vol. 103 (1985), North-Holland · Zbl 0597.03009
[19] Väänänen, J. A., On the semantics of informational independence, Log. J. IGPL, 10, 3, 339-352 (2002) · Zbl 1005.03033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.