Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.09.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029164961 / rank | |||
Normal rank | |||
Latest revision as of 21:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete |
scientific article |
Statements
Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (English)
0 references
21 March 2013
0 references
modal logic
0 references
counting quantifiers
0 references
computational complexity
0 references
tiling problem
0 references
finite model property
0 references
theory of computation
0 references
