Back to the index. Or to the chambers

This article has 12 links. View as Cloud or List.

Collection Axiom Category Set Terms And Formulas Elementarily Equivalent Set Theory Quantifier Zermelo Fraenkel Axioms Quantum Logic Russells Paradox Z

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Comprehension Axiom

The axiom of comprehension (CA) states that every formula defines a set. That is,

$\displaystyle \exists X\forall x(x\in X\leftrightarrow\phi(x))$ for any formula $\displaystyle \phi$ where $\displaystyle X$ does not occur free in $\displaystyle \phi$

The names specification and separation are sometimes used in place of comprehension, particularly for weakened forms of the axiom (see below).

In theories which make no distinction between objects and sets (such as ZF), this formulation leads to Russell's paradox, however in stratified theories this is not a problem (for example second order arithmetic includes the axiom of comprehension).

This axiom can be restricted in various ways. One possibility is to restrict it to forming subsets of sets:

$\displaystyle \forall Y\exists X\forall x(x\in X\leftrightarrow x\in Y\wedge\phi(x))$ for any formula $\displaystyle \phi$ where $\displaystyle X$ does not occur free in $\displaystyle \phi$

This formulation (used in ZF set theory) is sometimes called the Aussonderungsaxiom.

Another way is to restrict $\phi$ to some family , giving the axiom F-CA. For instance the axiom $\Sigma^0_1$ -CA is:

$\displaystyle \exists X\forall x(x\in X\leftrightarrow\phi(x))$ where $\displaystyle \phi$ is $\displaystyle \Sigma^0_1$ and $\displaystyle X$ does not occur free in $\displaystyle \phi$

A third form (usually called separation) uses two formulas, and guarantees only that those satisfying one are included while those satisfying the other are excluded. The unrestricted form is the same as unrestricted collection, but, for instance, $\Sigma^0_1$ separation:

$\displaystyle \forall x\neg(\phi(x)\wedge\psi(x))\rightarrow\exists X\forall x((\phi(x)\rightarrow x\in X)\wedge(\psi(x)\rightarrow x\notin X))$

where $\displaystyle \phi$ and $\displaystyle \psi$ are $\displaystyle \Sigma^0_1$ and $\displaystyle X$ does not occur free in $\displaystyle \phi$ or $\displaystyle \psi$

is weaker than $\Sigma^0_1$ -CA.

1	Category
1	Collection
1	Set Theory
1	Set
1	Terms And Formulas
1	Elementarily Equivalent
1	Axiom
1	Zermelo Fraenkel Axioms
1	Quantifier
2	Quantum Logic
2	Russells Paradox
6	Z