Pages that link to "Item:Q1941691"
From MaRDI portal
The following pages link to Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691):
Displaying 2 items.
The following pages link to Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691):
Displaying 2 items.