Expressive Power and Decidability for Memory Logics

CARLOS ARECES; DIEGO FIGUEIRA; SANTIAGO FIGUEIRA; SERGIO MERA

LECTURE NOTES IN COMPUTER SCIENCE

Springer

Lugar: Berlin / Heidelberg; Año: 2008 vol. 5110 p. 56 - 68

0302-9743

Taking as inspiration the hybrid logic HL(down), 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 HL(down). We also establish the undecidability of their satisfiability problems.