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]

Authors

Bartosz Bednarczyk

This author has not been identified. Look up 'Bartosz Bednarczyk' in Google

Stéphane Demri

This author has not been identified. Look up 'Stéphane Demri' in Google