Boolean Quantification in a First-Order Context
نویسندگان
چکیده
We establish a framework to integrate propositional logic with first-order logic. This is done in such a way that it optionally appears either as first-order logic over a Boolean algebra or as propositional logic including Boolean quantification. We describe and prove complexity bounds for extended quantifier elimination by virtual substitution for our theory. This extended quantifier elimination is, besides many other mathematical algorithms and utilities, implemented in a new context ibalp of the reduce package redlog. We demonstrate the capabilities of this new context by means of numerous application and benchmark examples including qsat problems.
منابع مشابه
Boolean unification with predicates
In this article, we deal with the following problem which we call Boolean unification with predicates: For a given formula F[X ] in first-order logic with equality containing an n-ary predicate variable X , is there a quantifier-free formula G[x1,...,xn] such that the formula F[G] is valid in first-order logic with equality? We obtain the following results. Boolean unification with predicates f...
متن کاملBoolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کامل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...
متن کاملQuantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boolean algebras of sets, this is a new generalization of Boole’s well-known variable elimination method for conjunctions of Boolean equality constraints. We also explain the connection of this new logical result with the evaluati...
متن کاملLanguage Learners' Imagined Communities: Model and Questionnaire Development in the Iranian Context
This study aimed to overcome the researchers' extreme attention to essentially qualitative methods in research on language learners' imagined communities and move towards quantification in order to achieve a more tangible image of this construct. To do so, the present researchers followed three main phases. First, a hypothesized model of language learners' imagined communities with eight compon...
متن کامل