Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903)
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: Complexity of finite-variable fragments of propositional temporal and modal logics of computation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of finite-variable fragments of propositional temporal and modal logics of computation |
scientific article |
Statements
Complexity of finite-variable fragments of propositional temporal and modal logics of computation (English)
0 references
24 June 2022
0 references
branching-time temporal logics
0 references
alternating-time temporal logics
0 references
modal logics
0 references
finite-variable fragments
0 references
computational complexity
0 references
satisfiability problem
0 references
validity problem
0 references
