quantifier algebra
A quantifier algebra is a triple $(B,V,\exists )$, where $B$ is a Boolean algebra^{}, $V$ is a set, and $\exists $ is a function
$$\exists :P(V)\to {B}^{B}$$ 
from the power set^{} of $V$ to the set of functions on $B$, such that

1.
the pair $(B,\exists (I))$ is a monadic algebra for each subset $I\subseteq V$,

2.
$\exists (\mathrm{\varnothing})={I}_{B}$, the identity function on $B$, and

3.
$\exists (I\cup J)=\exists (I)\circ \exists (J)$, for any $I,J\in P(V)$.
The cardinality of $V$ is called the degree of the quantifier algebra $(B,V,\exists )$.
Think of $V$ as a set of variables^{} and $B$ a set of propositional functions closed under^{} the usual logical connectives. From this, $\exists (I)$ in the first condition can be viewed as the existential quantifier^{} $\exists $ bounding a set $I$ of variables. The second condition stipulates that, when no variables are bound by $\exists $, then $\exists $ has no effect on the propositional functions. The last condition states that the order and frequency of the variables bound by $\exists $ does not affect the outcome ($\exists {x}_{2},{x}_{1},{x}_{2}$ is the same as $\exists {x}_{1}\exists {x}_{2}$).
Remarks

•
A monadic algebra is a quantifier algebra where $V=\{x\}$, a singleton, and a Boolean algebra is just a quantifier algebra with $V=\mathrm{\varnothing}$.

•
In classical first order logic, the set of variables bound by a quantifier appearing in a formula^{} is finite. Any variable not bound by the quantifier is considered free, as far as the scope of the quantifier is concerned. This basically says that every propositional function in the classical first order logic has a finite number variables. Translated into the language^{} of quantifier algebras, this means that
for each $p\in B$, there is a finite $I\subseteq V$, such that $\exists (VI)(p)=p$.
Any quantifier algebra satisfying the above condition is said to be locally finite^{}.
Alternatively, a set $I\subseteq V$ is called a support of $p\in B$ if $\exists (VI)(p)=p$. The intersection^{} of all supports of $p$ is called the support of $p$, denoted by $\mathrm{Supp}(p)$. $B$ is locally finite iff every element of $B$ has a finite support, or that $\mathrm{Supp}(p)$ is finite.

•
Quantifier algebras are a step closer in fully characterizing the “algebra^{}” of predicate logic than monadic algebras. However, it is not powerful enough to address situations where a “change of variable” occurs in a propositional function, such as $\exists x({x}^{2}+{z}^{2}=1)$ versus $\exists y({y}^{2}+{z}^{2}=1)$. In a quatifier algebra, these two formulas are distinct, even though they are the same semantically in logic. In order take into account these additional considerations, polyadic algebras are needed.
References
 1 P. Halmos, Algebraic Logic, Chelsea Publishing Co. New York (1962).
 2 B. Plotkin, Universal Algebra^{}, Algebraic Logic, and Databases, Kluwer Academic Publishers (1994).
Title  quantifier algebra 

Canonical name  QuantifierAlgebra 
Date of creation  20130322 17:49:04 
Last modified on  20130322 17:49:04 
Owner  CWoo (3771) 
Last modified by  CWoo (3771) 
Numerical id  10 
Author  CWoo (3771) 
Entry type  Definition 
Classification  msc 03G15 
Related topic  MonadicAlgebra 
Related topic  PolyadicAlgebra 
Defines  locally finite 