Pages that link to "Item:Q3897033"
From MaRDI portal
The following pages link to Decision complexity of variants of propositional dynamic logic (Q3897033):
Displayed 7 items.
- On the computational complexity of satisfiability in propositional logics of programs (Q1170028) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- Deterministic propositional dynamic logic: finite models, complexity, and completeness (Q1839245) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Loop-type sequent calculi for temporal logic (Q2228437) (← links)
- A derivation-loop method for temporal logic (Q5040806) (← links)
- More efficient proof-search for sequents of temporal logic (Q5058432) (← links)