Completeness results for memory logics

Annals of Pure and Applied Logic - Tập 163 - Trang 961-972 - 2012
Carlos Areces1, Santiago Figueira2,3, Sergio Mera2
1INRIA Nancy Grand Est, France
2Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina
3CONICET, Argentina

Tài liệu tham khảo

Alur, 1989, A really temporal logic, 164 C. Areces, Hybrid logics: the old and the new, in: Proceedings of LogKCA-07, San Sebastian, Spain, 2007, pp. 15–29. Areces, 2008, Expressive power and decidability for memory logics, vol. 5110, 56 Areces, 2011, The expressive power of memory logics, The Review of Symbolic Logic, 4, 290, 10.1017/S1755020310000389 C. Areces, B. ten Cate, Hybrid logics, in: Blackburn et al. [9], pp. 821–868. Blackburn, 2000, Representation, reasoning, and relational structures: a hybrid logic manifesto, Logic Journal of the IGPL, 8, 339, 10.1093/jigpal/8.3.339 Blackburn, 2001 Blackburn, 1998, Hybrid completeness, Logic Journal of the IGPL, 6, 625, 10.1093/jigpal/6.4.625 2006 J. Gerbrandy, Bisimulations on planet Kripke, Ph.D. Thesis, University of Amsterdam, iLLC Dissertation series DS-1999-01, 1999. E. Harel, O. Lichtenstein, A. Pnueli, Explicit clock temporal logic, in: Proceedings of LICS’90, 1990, pp. 402–413. Henzinger, 1990, Half-order modal logic: how to prove real-time properties, 281 C. Lutz, The complexity of reasoning with concrete domains, Ph.D. Thesis, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2002. J. Plaza, Logics of public communications, in: 4th International Symposium on Methodologies for Intelligent Systems, 1989, pp. 201–216. van Benthem, 2001, Logics for information update, 51 van Benthem, 2006, Logics of communication and change, Information and Computation, 204, 1620, 10.1016/j.ic.2006.04.006 van Ditmarsch, 2007