"Satisfiability problem for modal logic with global counting operators ..."

Michal Zawidzki, Renate A. Schmidt, Dmitry Tishkovsky (2013)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2012.09.007

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/ZawidzkiST13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ZawidzkiST13
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.