Sciweavers

Share
FROCOS
2007
Springer

Idempotent Transductions for Modal Logics

9 years 4 months ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quantifiers. These logics are refered to as the idempotent transduction logics and are defined using the programs of propositional dynamic logic including converse and tests. This is a nontrivial extension of the decidability of the positive idempotent transduction logics which do not use converse operators in the programs (French, 2006). This extension allows us to apply bisimulation quantifiers to, for example, logics of knowledge, logics of belief and tense logics. We show the idempotent transduction logics preserve the axioms of propositional quantification and are decidable. The definition of idempotent transduction logics allows us to apply these results to a number of combined modal logics with a variety of interactions between modalities.
Tim French
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FROCOS
Authors Tim French
Comments (0)
books