Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:45, 1 February 2024
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
