All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All finitely axiomatizable tense logics of linear time flows are coNP-complete |
scientific article |
Statements
All finitely axiomatizable tense logics of linear time flows are coNP-complete (English)
0 references
17 March 2006
0 references
NP-completeness
0 references
tense logic
0 references
temporal logic
0 references
computational complexity
0 references
frame incompleteness
0 references
