Abstract
In [1] Cameron and Hodges proved, by means of a combinatorial argument, that no compositional semantics for a logic of Imperfect Information such as Independence Friendly Logic [2] or Dependence Logic ([3]) may use sets of tuples of elements as meanings of formulas.
However, Cameron and Hodges’ theorem fails if the domain of the semantics is restricted to infinite models only, and they conclude that
Common sense suggests that there is no sensible semantics for CS on infinite structures A , using subsets of the domain of A as interpretations for formulas with one free variable. But we don’t know a sensible theorem along these lines ([1]).
This work develops a formal, natural definition of “sensible semantics” according to which the statement quoted above can be proved.
This work was supported by the European Science Foundation Eurocores programme LogICCC [FP002 - Logic for Interaction (LINT)].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cameron, P., Hodges, W.: Some Combinatorics of Imperfect Information. The Journal of Symbolic Logic 66(2), 673–684 (2001)
Hintikka, J.: The Principles of Mathematics Revisited. Cambridge University Press, Cambridge (1996)
Väänänen, J.: Dependence Logic. Cambridge University Press, Cambridge (2007)
Hodges, W.: Compositional Semantics for a Language of Imperfect Information. Journal of the Interest Group in Pure and Applied Logics 5 (4), 539–563 (1997)
Henkin, L.: Some Remarks on Infinitely Long Formulas. In: Infinitistic Methods. Proc. Symposium on Foundations of Mathematics, pp. 167–183. Pergamon Press, Oxford (1961)
Hintikka, J., Sandu, G.: Informational independence as a semantic phenomenon. In: Fenstad, J., Frolov, I., Hilpinen, R. (eds.) Logic, Methodology and Philosophy of Science, pp. 571–589. Elsevier, Amsterdam (1989)
Janssen, T.: Independent Choices and the Interpretation of IF Logic. Journal of Logic, Language and Information 11, 367–387 (2002)
Caicedo, X., Dechesne, F., Jannsen, T.: Equivalence and Quantifier Rules for Logic with Imperfect Information. Logic Journal of the IGPL 17(1), 91–129 (2009)
Hintikka, J., Sandu, G.: Game-Theoretical Semantics. In: van Benthem, J., Meulen, A.T. (eds.) Handbook of Logic and Language, pp. 361–410. Elsevier, Amsterdam (1997)
Hodges, W.: Logics of imperfect information: why sets of assignments. In: van Benthem, J., Gabbay, D., Löwe, B. (eds.) Proceedings of 7th De Morgan Workshop ’Interactive Logic: Games and Social Software (2005)
Hodges, W.: Formal features of compositionality. Journal of Logic, Language, and Information 10(1), 7–28 (2001)
Janssen, T.: Compositionality. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 417–473. Elsevier, Amsterdam (1996)
Montague, R.: Universal grammar. Theoria 36, 373–398 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galliani, P. (2011). Sensible Semantics of Imperfect Information. In: Banerjee, M., Seth, A. (eds) Logic and Its Applications. ICLA 2011. Lecture Notes in Computer Science(), vol 6521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18026-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-18026-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18025-5
Online ISBN: 978-3-642-18026-2
eBook Packages: Computer ScienceComputer Science (R0)