Descriptive Complexity and Finite Models
Neil Immerman, Phokion G. Kolaitis · DIMACS series in discrete mathematics and theoretical computer science · 1997
This paper introduces algebraic proof systems for the propositional calculus. We present new results concerning the relative efficiency of these systems, and also survey what is currently known. Many open problems are presented.