Parametrized Modal Logic II: The Unidimensional Case
Résumé
We consider a syntax and semantics of modal logics based on parametrized modal connectives with ∃∀-satisfaction definitions, we axiomatically introduce different parametrized modal logics, we prove their completeness AQ1 with respect to appropriate classes of parametrized relational structures and we show the decidability of some related satisfiability problems.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|