Why propositional quantification makes modal logics on trees robustly hard? (Q6654467)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Why propositional quantification makes modal logics on trees robustly hard? |
scientific article; zbMATH DE number 7959674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why propositional quantification makes modal logics on trees robustly hard? |
scientific article; zbMATH DE number 7959674 |
Statements
Why propositional quantification makes modal logics on trees robustly hard? (English)
0 references
19 December 2024
0 references