"Why Does Propositional Quantification Make Modal and Temporal Logics on ..."

Bartosz Bednarczyk, Stéphane Demri (2022)

> Home

Details and statistics

DOI: 10.46298/LMCS-18(3:5)2022

access: open

type: Journal Article

metadata version: 2023-01-24

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/lmcs/BednarczykD22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/BednarczykD22
Bartosz Bednarczyk, Stéphane Demri:
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Log. Methods Comput. Sci. 18(3) (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.