THE EXPRESSIVE POWER OF MEMORY LOGICS

@article{Areces2011THEEP,
title={THE EXPRESSIVE POWER OF MEMORY LOGICS},
author={Carlos Areces and Diego Figueira and Santiago Figueira and Sergio Fernando Mera},
journal={The Review of Symbolic Logic},
year={2011},
volume={4},
pages={290 - 318}
}
• Published 1 June 2011
• Computer Science, Philosophy
• The Review of Symbolic Logic
We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory. From this perspective, the hybrid logic ℋℒ (↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain. This work focuses in the case where the memory is a set, and we can test whether…
Basic Model Theory for Memory Logics
• Computer Science, Philosophy
WoLLIC
• 2011
Basic model properties of memory logics are studied, and results concerning characterization, definability and interpolation are proved.
Swap logic
• Mathematics
Log. J. IGPL
• 2014
It is shown that SL is equivalent to a fragment of first-order logic by providing a satisfiability preserving translation and an equivalence preserving translation from SL to the hybrid logicH(:, ↓), and a suitable notion of bisimulation for SL is defined.
Satisfiability for relation-changing logics
• Computer Science, Philosophy
J. Log. Comput.
• 2018
It is shown that relation-changing modal logics, extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula, can be translated into hybrid logic and satisfiability is, in general, undecidable.
The Expressive Power of Swap Logic
Modal logics are appropriate to describe properties of graphs. But usually these are static properties. We investigate dynamic modal operators that can change the model during evaluation. We define
Extending ALCQ with Bounded Self-Reference
• Mathematics
• 2012
A polynomial satisfiability-preserving encoding of ALCQme2 into ALCHIQbe is provided and it is proved that the latter is decidable in EXPTIME.
Translations: generalizing relative expressiveness between logics
The aim of this paper is to propose a sufficiently general and reasonable formal criterion for expressiveness, so as to apply not only to model-theoretic logics, but also to Tarskian and proof-the theoretical logics.
Narcissists Are Easy, Stepmothers Are Hard
• Computer Science
FoSSaCS
• 2012
This work investigates the logics obtained by restricting the nesting depth of modalities between binding and use and investigates the fragment with distance 1 in the framework of coalgebraic modal logic, for which it provides very general decidability and complexity results.
Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq
• Computer Science, Philosophy
DaLí
• 2019
This work formalizes and verify in the proof assistant Coq, the bisimulation theorems for a particular family of dynamic logics that can change the accessibility relation of a model.
Expressive Power of “Now” and “Then” Operators
It is shown that backwards-looking operators increase its expressive power quite mildly, contrary to beliefs widespread among philosophers of language and formal semanticists.
Undecidability of Relation-Changing Modal Logics
• Philosophy, Computer Science
DALI@TABLEAUX
• 2017
This work defines satisfiability-preserving translations from an undecidable memory logic to relation-changing modal logics and shows that their satisfiability problems are undecisive.

References

SHOWING 1-10 OF 61 REFERENCES
Expressive Power and Decidability for Memory Logics
• Computer Science, Philosophy
WoLLIC
• 2008
It is proved that in terms of expressive power, the memory logics discussed in this paper are more expressive than orthodox modal logic, but less expressive than $\mathcal{HL}({\downarrow})$.
Tableaux and Model Checking for Memory Logics
• Computer Science
TABLEAUX
• 2009
This paper gives sound and complete tableaux calculi for the memory logic $\mathcal {ML}$(***, ***, ***) and some of its sublanguages, and shows that the model checking problem is PSpace-complete.
The Computational Complexity of Hybrid Temporal Logics
• Philosophy
Log. J. IGPL
• 2000
This paper analyzes the complexity of the satisfiability problem of a number of hybrid temporal logics: the basic hybrid language over transitive frames; nominal tense logic overTransitive frames, strict total orders, and transitive trees; nominal Until logic; and referential interval logic.
Half-order modal logic: how to prove real-time properties
A novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible woxld is introduced, and a complete proof system is presented for TPTL, which can be used to derive real-time properties.
Hybrid logics
• Philosophy
Handbook of Modal Logic
• 2007
Hybrid logics: characterization, interpolation and complexity
• Computer Science
Journal of Symbolic Logic
• 2001
It is shown that (↓, @) enjoys (strong) interpolation, provide counterexamples for its finite variable fragments, and show that weak interpolation holds for the sublanguage (@).
Logics of public communications
Extensions of the logic S5 which can deal with public communications are defined and some completeness, decidability and interpretability results are proved and a general method is formulated that solves certain kind of problems involving public communications.
Model-Checking in Dense Real-time
• Computer Science
Inf. Comput.
• 1993
An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
On the decidability of metric temporal logic
• Computer Science
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
• 2005
It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and that model checking the safety fragment of MTL-which includes invariance and time-bounded response properties-is also decidable.