All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685)
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: All finitely axiomatizable tense logics of linear time flows are coNP-complete |
scientific article; zbMATH DE number 5013023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All finitely axiomatizable tense logics of linear time flows are coNP-complete |
scientific article; zbMATH DE number 5013023 |
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
0.7825716137886047
0 references
0.7726006507873535
0 references
0.7721440196037292
0 references
