Revision history of "Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete" (Q1941691)
From MaRDI portal
Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
