...initions In this report we assume that familiarity with basic Boolean algebra terms and interpretations. In Boolean algebra two formulas may be called equivalent if they have the same set of solutions=-=[1]-=-, i.e., substitutions for the free variables that make them true. And according to Dr. Revesz, The purpose of quantifier elimination is to rewrite an existentially or universally quantified formula in...

...rdinality of every formula is either 0 or 1. Hence in the case of atomic Boolean algebras, equation(1) can be written as, 3 Quantifier elimination 1 ≤≤≤≤B,σσσσ (t1 ∧∧∧∧ t2 / ) ∨∨∨∨ (t1 / ∧∧∧∧ t2) ……. =-=(2)-=- The following method is proposed in the paper Cardinality Constraint Database paper by Dr. Revesz for eliminating quantifiers. Suppose we would like to eliminate an attribute A from a Boolean cardina...