Why propositional quantification makes modal logics on trees robustly hard?

DOI10.5555/3470152.3470154MaRDI QIDQ6654467zbMATH OpenFDO

Authors Bartosz Bednarczyk, Stéphane Demri

Publication date 19 December 2024

Full work available at URL https://doi.org/10.5555/3470152.3470154

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(1)

• Expressive power of propositionally quantified modal logics on variable domain structures with accessibility

This page was built for publication: Why propositional quantification makes modal logics on trees robustly hard?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654467)