Open AccessBook
The decision problem: Solvable classes of quantificational formulas
Burton Dreben,Warren D. Goldfarb +1 more
Reads0
Chats0
TLDR
In this article, the authors provide a unified treatment of the positive results of the decision problem for quantification theory, and delimit the boundary between solvable and unsolvable classes of formulas.Abstract:
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.read more
Citations
More filters
BookDOI
The classical decision problem
TL;DR: The Undecidable Standard Classes for Pure Predicate Logic, a Treatise on the Transformation of the Classical Decision Problem, and some Results and Open Problems are presented.
Proceedings Article
An analysis of first-order logics of probability
TL;DR: This work provides axiom systems that are sound and complete in cases where a complete axiomatization is possible, and shows that they do allow us to capture a great deal of interesting reasoning about probability.
Book ChapterDOI
Adding Structure to Unstructured Data
TL;DR: It is proposed that both data and schema be represented as edge-labeled graphs and notions of conformance between a graph database and a graph schema are developed and it is shown that there is a natural and efficiently computable ordering on graph schemas.
Book
Automated Theorem Proving
TL;DR: A comparison study of the connection method in propositional logic and its applications in first-order logic and in natural and formal logic.
Journal ArticleDOI
On the Decision Problem for Two-Variable First-Order Logic
TL;DR: In this paper, the complexity of the satisfiability problem for FO2 is shown to be NEXPTIME-complete, and it is shown that every satisfiable FO2-sentence has a model whose size is at most exponential in the size of the sentence.