✦ LIBER ✦
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
✍ Scribed by Zawidzki, Michał; Schmidt, Renate A.; Tishkovsky, Dmitry
- Book ID
- 119262887
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 216 KB
- Volume
- 113
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.