Completeness results for memory logics

C. Areces, S. Figueira, and S. Mera. Completeness results for memory logics. Annals of Pure and Applied Logic, 163(7):961–972, 2012. Extended version of LFCS'09 paper of the same title.

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

@Article{Areces2012a,
  author =       "C. Areces and S. Figueira and S. Mera",
  journal =      "Annals of Pure and Applied Logic",
  title =        "Completeness results for memory logics",
  year =         "2012",
  ISSN =         "0168-0072",
  note =         "Extended version of LFCS'09 paper of the same title.",
  number =       "7",
  pages =        "961--972",
  volume =       "163",
  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.",
  doi =          "10.1016/j.apal.2011.09.005",
  keywords =     "Modal logics",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0168007211001278",
}