Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete

Michal Zawidzki, Renate A. Schmidt, Dmitry Tishkovsky. Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete. Inf. Process. Lett., 113(1-2):34-38, 2013. [doi]

Abstract

Abstract is missing.