Bartosz Bednarczyk, Stéphane Demri. Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. pages 1-13, IEEE, 2019. [doi]
Abstract is missing.