Completeness results for memory logics

C. Areces, S. Figueira, and S. Mera. Completeness results for memory logics. In Proceedings of LFCS'09, the Symposium on Logic Foundations of Computer Science, pp. 16–30, Deerfield Beach, Florida, USA, 2009.

Download

[pdf] 

Abstract

Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided.

BibTeX

@InProceedings{Areces2009b,
  author =       "C. Areces and S. Figueira and S. Mera",
  booktitle =    "Proceedings of LFCS'09, the Symposium on Logic
                 Foundations of Computer Science",
  title =        "Completeness results for memory logics",
  year =         "2009",
  address =      "Deerfield Beach, Florida, USA",
  pages =        "16--30",
  series =       "LNCS",
  abstract =     "Memory logics are a family of modal logics in which
                 standard relational structures are augmented with data
                 structures and additional operations to modify and
                 query these structures. In this paper we present sound
                 and complete axiomatizations for some members of this
                 family. We analyze the use of nominals to achieve
                 completeness, and present one example in which they can
                 be avoided.",
  volume =       "5407",
}