Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?

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]

Abstract

Abstract is missing.