Frame-validity games and lower bounds on the complexity of modal axioms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logic Journal of the IGPL Année : 2020

Frame-validity games and lower bounds on the complexity of modal axioms

Résumé

We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols, and number of different propositional variables of modal formulae defining a given frame-property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.
Fichier principal
Vignette du fichier
IGPLaiml18.pdf (534.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02936458 , version 1 (11-09-2020)

Identifiants

Citer

Philippe Balbiani, David Fernández Duque, Andreas Herzig, Petar Iliev. Frame-validity games and lower bounds on the complexity of modal axioms. Logic Journal of the IGPL, 2020, 30 (1), ⟨10.1093/jigpal/jzaa068⟩. ⟨hal-02936458⟩
84 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More