1 paper
Michael Benedikt, Chia-Hsuan Lu, Tony Tan
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called loc…