Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691)
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: Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete |
scientific article; zbMATH DE number 6147761
| 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; zbMATH DE number 6147761 |
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
