![](/img/cover-not-exists.png)
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
Zawidzki, Michał, Schmidt, Renate A., Tishkovsky, DmitryVolume:
113
Language:
english
Journal:
Information Processing Letters
DOI:
10.1016/j.ipl.2012.09.007
Date:
January, 2013
File:
PDF, 216 KB
english, 2013