2.4.3: Quantifier Rules
Rules for \(\lforall{}{}\)
In \(\LeftR{\lforall{}{}}\) , \(t\) is a closed term (i.e., one without variables). In \(\RightR{\lforall{}{}}\) , \(a\) is a constant symbol which must not occur anywhere in the lower sequent of the \(\RightR{\lforall{}{}}\) rule. We call \(a\) the eigenvariable of the \(\RightR{\forall}\) inference.
Rules for \(\lexists{}{}\)
Again, \(t\) is a closed term, and \(a\) is a constant symbol which does not occur in the lower sequent of the \(\LeftR{\lexists{}{}}\) rule. We call \(a\) the eigenvariable of the \(\LeftR{\lexists{}{}}\) inference.
The condition that an eigenvariable not occur in the lower sequent of the \(\RightR{\lforall{}{}}\) or \(\LeftR{\lexists{}{}}\) inference is called the eigenvariable condition .
We use the term “eigenvariable” even though \(a\) in the above rules is a constant symbol. This has historical reasons.
In \(\RightR{\lexists{}{}}\) and \(\LeftR{\lforall{}{}}\) there are no restrictions on the term \(t\) . On the other hand, in the \(\LeftR{\lexists{}{}}\) and \(\RightR{\lforall{}{}}\) rules, the eigenvariable condition requires that the constant symbol \(a\) does not occur anywhere outside of \(A(a)\) in the upper sequent. It is necessary to ensure that the system is sound, i.e., only derives sequents that are valid. Without this condition, the following would be allowed:
However, \(\lexists{x}{A(x)} \Sequent \lforall{x}{A(x)}\) is not valid.