Analysis of logics with arithmetic
By: Michael Benedikt, Chia-Hsuan Lu, Tony Tan
Potential Business Impact:
Makes computers understand tricky math logic puzzles.
We present new results on finite satisfiability of logics with counting and arithmetic. This includes tight bounds on the complexity for two-variable logic with counting and cardinality comparisons between unary formulas, and also on logics with so-called local Presburger quantifiers. In the process, we provide simpler proofs of some key prior results on finite satisfiability and semi-linearity of the spectrum for these logics.
Similar Papers
Arithmetics within the Linear Time Hierarchy
Logic in Computer Science
Makes math problems solvable by computers.
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.
Deductive Systems for Logic Programs with Counting
Logic in Computer Science
Makes computer programs with counting work the same.