Quantifier Elimination in Second-Order Predicate Logic
نویسندگان
چکیده
An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pnψ where ψ is an arbitrary formula of first– order predicate logic. The resulting formula is equivalent to the original formula – if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second–order quantifiers in circumscription, to compute the correlations between structures and power structures, to compute semantic properties corresponding to Hilbert axioms in non classical logics and to compute model theoretic semantics for new logics. An earlier version of the paper has been published in [GO92b].
منابع مشابه
Literal Projection for First-Order Logic
The computation of literal projection generalizes predicate quantifier elimination by permitting, so to speak, quantifying upon an arbitrary sets of ground literals, instead of just (all ground literals with) a given predicate symbol. Literal projection allows, for example, to express predicate quantification upon a predicate just in positive or negative polarity. Occurrences of the predicate i...
متن کاملApproximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas
We investigate second-order quantifier elimination for a class of formulas characterized by a restriction on the quantifier prefix: existential predicate quantifiers followed by universal individual quantifiers and a relational matrix. For a given second-order formula of this class a possibly infinite sequence of universal first-order formulas that have increasing strength and are all entailed ...
متن کاملQuantifier Elimination and Real Closed Ordered Fields with a Predicate for the Powers of Two
In this thesis we first review the model theory of quantifier elimination and investigate the logical relations among various quantifier elimination tests. In particular we prove the equivalence of two quantifier elimination tests for countable theories. Next we give a procedure for eliminating quantifiers for the theory of real closed ordered fields with a predicate for the powers of two. This...
متن کاملThe Boolean Solution Problem from the Perspective of Predicate Logic (Abstract)
Finding solution values for unknowns in Boolean equations was, along with second-order quantifier elimination, a principal reasoning mode in the Algebra of Logic of the 19th century. Schröder [19] investigated it as Auflösungsproblem (solution problem). It is closely related to the modern notion of Boolean unification. For a given formula that contains unknowns formulas are sought such that aft...
متن کاملFrom Database Repair Programs to Consistent Query Answering in Classical Logic (extended abstract)
Consistent answers to a query from an inconsistent database are answers that can be simultaneously retrieved from every possible repair; and repairs are consistent instances that minimally differ from the original instance. Database repairs can be specified as the stable models of a disjunctive logic program. In this paper we show how to use the repair programs to transform the problem of consi...
متن کامل