INVESTIGADORES
FIGUEIRA Santiago
artículos
Título:
Completeness results for Memory Logics
Autor/es:
CARLOS ARECES; SANTIAGO FIGUEIRA; SERGIO MERA
Revista:
LECTURE NOTES IN COMPUTER SCIENCE
Editorial:
Springer
Referencias:
Lugar: Berlin / Heidelberg; Año: 2009 vol. 5407 p. 16 - 30
ISSN:
0302-9743
Resumen:
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.
