Bartosz Bednarczyk, Stéphane Demri. Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?. Logical Methods in Computer Science, 18(3), 2022. [doi]
@article{BednarczykD22,
title = {Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?},
author = {Bartosz Bednarczyk and Stéphane Demri},
year = {2022},
doi = {10.46298/lmcs-18(3:5)2022},
url = {https://doi.org/10.46298/lmcs-18(3:5)2022},
researchr = {https://researchr.org/publication/BednarczykD22},
cites = {0},
citedby = {0},
journal = {Logical Methods in Computer Science},
volume = {18},
number = {3},
}