Half-order modal logic: how to prove real-time properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Modal logic
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Logics of communication and change
Information and Computation
Expressive Power and Decidability for Memory Logics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Dynamic Epistemic Logic
Tableaux and Model Checking for Memory Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Basic model theory for memory logics
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
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.