On the formal semantics of IF-like logics
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 invarian...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
2008
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 07346caa a22007697a 4500 | ||
|---|---|---|---|
| 001 | PAPER-5795 | ||
| 003 | AR-BaUEN | ||
| 005 | 20250225143648.0 | ||
| 008 | 190411s2008 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-47749099752 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Figueira, S. | |
| 245 | 1 | 3 | |a On the formal semantics of IF-like logics |
| 260 | |c 2008 | ||
| 270 | 1 | 0 | |m Figueira, S.; Departamento de Computación, FCEyN, Universidad de Buenos AiresArgentina |
| 504 | |a Barendregt, H., The Lambda Calculus: Its syntax and semantics (1985) Studies in logic and the foundations of mathematics, 103. , 2nd edn, North Holland, Amsterdam | ||
| 504 | |a Barwise, J., On branching quantifiers in English (1979) Journal of Philosophical Logic, 8, pp. 47-80 | ||
| 504 | |a Caicedo, X., Dechesne, F., Jansen, T.M.V., Equivalence and quantifier rules for logic with imperfect information (2007) Prepublication Series PP, 2007 -20. , ILLC | ||
| 504 | |a Caicedo, X., Krynicki, M., Quantifiers for reasoning with imperfect information and Σ11-logic (1999) Contemporary Mathematics, 235, pp. 17-31 | ||
| 504 | |a de Bruijn, N.G., Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the Church-Rosser theorem (1972) Indagationes Mathematicae, 34, pp. 381-392 | ||
| 504 | |a Dechesne, F., (2005) Game, Sets, Maths: Formal investigations into logic with imperfect information, , PhD thesis, Department of Philosophy, University of Tilburg, The Netherlands | ||
| 504 | |a Enderton, H., Finite partially ordered quantifiers (1970) Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 16, pp. 393-397 | ||
| 504 | |a Henkin, L., Some remarks on infinitely long formulas (1961) Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, pp. 167-183. , Pergamon Press, Oxford | ||
| 504 | |a Hintikka, J., (1996) The Principles of Mathematics Revisited, , Cambridge University Press, Cambridge | ||
| 504 | |a Hintikka, J., Sandu, G., Game-theoretical semantics (1997) Handbook of logic and language, , van Benthem, J, ter Meulen, A, eds, ch. 6. MIT Press, Cambridge | ||
| 504 | |a Hodges, W., Compositional semantics for a language of imperfect information (1997) Logic Journal of the IGPL, 5 (4) | ||
| 504 | |a Hodges, W., Logics of imperfect information: Why sets of assignments? (2005) Proceedings of the 7th Augustus de Morgan Workshop Interactive Logic: Games and Social Software | ||
| 504 | |a Hodges, W., Some strange quantifiers (1997) LNCS, 1261, pp. 51-65. , Mycielski, J, Rozenberg, G, Salomaa, A, eds, Structures in Logic and Computer Science, Springer, Heidelberg | ||
| 504 | |a Janssen, T.M.V., Independent choices and the interpretation of IF logic (2002) Journal of Logic, Language and Information, 11 (3), pp. 367-387 | ||
| 504 | |a Janssen, T.M.V., Dechesne, F., Signalling in IF games: A tricky business (2006) The age of alternative logics, pp. 221-241. , ch. 15, pp, Springer, Heidelberg | ||
| 504 | |a Walkoe Jr., W., Finite partially-ordered quantification (1970) Journal of Symbolic Logic, 35 (4), pp. 535-555 | ||
| 506 | |2 openaire |e Política editorial | ||
| 520 | 3 | |a 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. © 2008 Springer-Verlag Berlin Heidelberg. |l eng | |
| 536 | |a Detalles de la financiación: Universidad de Buenos Aires, PIP 114-200801-00370 | ||
| 536 | |a Detalles de la financiación: Fonds Wetenschappelijk Onderzoek | ||
| 536 | |a Detalles de la financiación: European Commission, FP6-IST-FET | ||
| 536 | |a Detalles de la financiación: Agencia Nacional de Promoción Científica y Tecnológica, UBACyT X615 | ||
| 536 | |a Detalles de la financiación: Consejo Nacional de Investigaciones Científicas y Técnicas, UBACyT X484, G.0344.05 | ||
| 536 | |a Detalles de la financiación: The authors thank Xavier Caicedo for having introduced them to the subject of IF logics and an anonymous referee for the precise corrections and fruitful suggestions. This work was partially supported by several grants. S. Figueira acknowledges grant PICT2067 from ANPCyT (Argentina), grant UBACyT X615 from the University of Buenos Aires and grant PIP 114-200801-00370 from CONICET (Argentina). D. Gorín acknowledges grant PICT2067 from ANPCyT (Argentina), grant UBACyT X484 from the University of Buenos Aires and a PhD scholarship from CONICET (Argentina). R. Grimson acknowledges grant G.0344.05 from the Research Foundation Flanders (FWO-Vlaanderen) and the European Union under the FP6-IST-FET programme, Project No. FP6-14915, GeoPKDD: Geographic Privacy-Aware Knowledge Discovery and Delivery. | ||
| 593 | |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina | ||
| 593 | |a Departamento de Matemática, FCEyN, Universidad de Buenos Aires, Argentina | ||
| 593 | |a Hasselt University, Transnational University of Limburg | ||
| 593 | |a CONICET, Argentina | ||
| 690 | 1 | 0 | |a CANNING |
| 690 | 1 | 0 | |a GAME THEORY |
| 690 | 1 | 0 | |a INFORMATION THEORY |
| 690 | 1 | 0 | |a LINGUISTICS |
| 690 | 1 | 0 | |a SEMANTICS |
| 690 | 1 | 0 | |a BOUND VARIABLES |
| 690 | 1 | 0 | |a CLASSICAL LOGICS |
| 690 | 1 | 0 | |a COMPOSITIONALITY |
| 690 | 1 | 0 | |a FORMAL SEMANTICS |
| 690 | 1 | 0 | |a HEIDELBERG (CO) |
| 690 | 1 | 0 | |a INTERNATIONAL (CO) |
| 690 | 1 | 0 | |a FUZZY LOGIC |
| 700 | 1 | |a Gorín, D. | |
| 700 | 1 | |a Grimson, Rafael | |
| 711 | 2 | |c Edinburgh |d 1 July 2008 through 4 July 2008 |g Código de la conferencia: 72694 | |
| 773 | 0 | |d 2008 |g v. 5110 LNAI |h pp. 164-178 |p Lect. Notes Comput. Sci. |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |x 03029743 |w (AR-BaUEN)CENRE-983 |z 3540699368 |z 9783540699361 |t 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008 | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-47749099752&doi=10.1007%2f978-3-540-69937-8_15&partnerID=40&md5=ee89d51e4047c02524e58338cdb1ff80 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-540-69937-8_15 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_03029743_v5110LNAI_n_p164_Figueira |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5110LNAI_n_p164_Figueira |y Registro en la Biblioteca Digital |
| 961 | |a paper_03029743_v5110LNAI_n_p164_Figueira |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 66748 | ||