Modal logic
Completeness Results for Memory Logics
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Tableaux and Model Checking for Memory Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Dialogue systems for virtual environments
YIWCALA '10 Proceedings of the NAACL HLT 2010 Young Investigators Workshop on Computational Approaches to Languages of the Americas
Basic model theory for memory logics
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
On characterization, definability and ω-saturated models
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
| Hi-index | 0.00 |
Taking as inspiration the hybrid logic $\mathcal{HL}({\downarrow})$, we introduce a new family of logics that we call memory logics. In this article we present in detail two interesting members of this family defining their formal syntax and semantics. We then introduce a proper notion of bisimulation and investigate their expressive power (in comparison with modal and hybrid logics). We will prove that in terms of expressive power, the memory logics we discuss in this paper are more expressive than orthodox modal logic, but less expressive than $\mathcal{HL}({\downarrow})$. We also establish the undecidability of their satisfiability problems.