Rules of passage (logic)

From Wikipedia, the free encyclopedia

In mathematical logic, the rules of passage govern how quantifiers distribute over the basic logical connectives of first-order logic. The rules of passage govern the "passage" (translation) from any formula of first-order logic to the equivalent formula in prenex normal form, and vice versa.

1 The rules
2 See also
3 References
4 External link

[edit] The rules

See Quine (1982: 119, chpt. 23). Let Q and Q 'denote ∀ and ∃ or vice versa. β denotes a closed formula in which x does not appear. The rules of passage then include the following sentences, whose main connective is the biconditional:

$Qx[\lnot\alpha (x)] \leftrightarrow \lnot Q'x[\alpha (x)].$

$\ Qx[\beta \or \alpha (x)] \leftrightarrow (\beta \or Qx \alpha (x)).$

$\exist x[\alpha (x) \or \gamma (x)] \leftrightarrow (\exist x \alpha (x) \or \exist x \gamma (x)).$

$\ Qx[\beta \and \alpha (x)] \leftrightarrow (\beta \and Qx \alpha (x)).$

$\forall x \, [\alpha(x) \land \gamma(x)] \leftrightarrow (\forall x \, \alpha(x) \land \forall x \, \gamma(x) ).$

The following conditional sentences can also be taken as rules of passage:

$\exist x[\alpha (x) \and \gamma (x)] \rightarrow (\exist x \alpha (x) \and \exist x \gamma (x)).$
$(\forall x \, \alpha(x) \or \forall x \, \gamma(x)) \rightarrow \forall x \, [\alpha(x) \or \gamma(x)].$
$(\exists x \, \alpha(x) \and \forall x \, \gamma(x)) \rightarrow \exists x \, [\alpha(x) \and \gamma(x)].$

"Rules of passage" first appeared in French, in the writings of Jacques Herbrand. Quine employed the English translation of the phrase in each edition of his Methods of Logic, starting in 1950.

[edit] See also

[edit] References

Willard Quine, 1982. Methods of Logic, 4th ed. Harvard Univ. Press.
Jean Van Heijenoort, 1967. From Frege to Godel: A Source Book on Mathematical Logic. Harvard Univ. Press.