Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2022.04.056 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2022.04.056 / rank | |||
Normal rank | |||
Latest revision as of 06:08, 17 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
