184 citations · 617 across the 22 of their papers we have counts for
1 paper · 1 filter
Ian Pratt-Hartmann
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional sy…