Abstract
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 Information Friendly (IF) logics. In this work we propose an alternative formalization under which invariance with respect the renaming of bound variables is restored. We show that, when one restricts to formulas where each variable is bound only once, our semantics coincide with those previously used in the literature. We also prove basic metatheoretical results of the resulting logic, such as compositionality and truth preserving operations on valuations. We work on Hodges’ slash logic (from which results can be easily transferred to other IF-like logics) and we also consider his flattening operator, for which we give a game-theoretical semantics.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barendregt, H.: The Lambda Calculus: its syntax and semantics, 2nd edn. Studies in logic and the foundations of mathematics, vol. 103. North Holland, Amsterdam (1985)
Barwise, J.: On branching quantifiers in English. Journal of Philosophical Logic 8, 47–80 (1979)
Caicedo, X., Dechesne, F., Jansen, T.M.V.: Equivalence and quantifier rules for logic with imperfect information. Prepublication Series PP-2007-20. ILLC (2007)
Caicedo, X., Krynicki, M.: Quantifiers for reasoning with imperfect information and \(\Sigma^1_1\)-logic. Contemporary Mathematics 235, 17–31 (1999)
de Bruijn, N.G.: Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 381–392 (1972)
Dechesne, F.: Game, Sets, Maths: formal investigations into logic with imperfect information. PhD thesis, Department of Philosophy, University of Tilburg, The Netherlands (2005)
Enderton, H.: Finite partially ordered quantifiers. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 16, 393–397 (1970)
Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, pp. 167–183. Pergamon Press, Oxford (1961)
Hintikka, J.: The Principles of Mathematics Revisited. Cambridge University Press, Cambridge (1996)
Hintikka, J., Sandu, G.: Game-theoretical semantics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of logic and language, ch. 6. MIT Press, Cambridge (1997)
Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL 5(4) (1997)
Hodges, W.: Logics of imperfect information: why sets of assignments? In: Proceedings of the 7th Augustus de Morgan Workshop Interactive Logic: Games and Social Software (2005)
Hodges, W.: Some strange quantifiers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 51–65. Springer, Heidelberg (1997)
Janssen, T.M.V.: Independent choices and the interpretation of IF logic. Journal of Logic, Language and Information 11(3), 367–387 (2002)
Janssen, T.M.V., Dechesne, F.: Signalling in IF games: a tricky business. In: The age of alternative logics, ch. 15, pp. 221–241. Springer, Heidelberg (2006)
Walkoe Jr., W.: Finite partially-ordered quantification. Journal of Symbolic Logic 35(4), 535–555 (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Figueira, S., Gorín, D., Grimson, R. (2008). On the Formal Semantics of IF-Like Logics. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-69937-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69936-1
Online ISBN: 978-3-540-69937-8
eBook Packages: Computer ScienceComputer Science (R0)