| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4661882 | Annals of Pure and Applied Logic | 2012 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
