Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

Details

Original languageEnglish
Title of host publication34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019
PublisherVorlage:IEEE
Pages1-13
Number of pages13
ISBN (print)978-1-7281-3608-0
Publication statusPublished - 2019
Peer-reviewedYes

External IDs

Scopus 85070745829