The decision problem: Solvable classes of quantificational formulas
Burton Dreben, Warren Goldfarb · Medical Entomology and Zoology · 1979
Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed the decision problem by associating with each quantificational formula a set, usually infinite, of quantifier-free formulas. In this book, the authors build on that insight to illuminate the mathematical structures underlying solvability, and provide for the first time a unified treatment of the positive results of the decision problem for quantification theory. The results of this book, together with those of Lewis's Unsolvable Classes of Quantificational Formulas, delimit the boundary between solvable and unsolvable.