Why propositional quantification makes modal logics on trees robustly hard ?

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Why propositional quantification makes modal logics on trees robustly hard ?

Bartosz BednarczykBartosz Bednarczyk,  Stéphane DemriStéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?


Bartosz Bednarczyk, Stéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, to appear
@inproceedings{BD2019,
  author    = {Bartosz Bednarczyk and St{\'{e}}phane Demri},
  title     = {Why propositional quantification makes modal logics on trees
               robustly hard ?},
  booktitle = {LICS 2019},
  year      = {2019},
  month     = {June}
}