axiom schema of separation

English

Noun

axiom schema of separation (plural axiom schema of separations)

  1. (set theory) The axiom schema stating that for every set A and every condition Sx, there exists a set B whose elements are exactly those members of A for which Sx holds.
    • 1908, Ernst Zermelo, Investigations in the Foundations of Set Theory I:
      Whenever a propositional function Sx is definite for all elements of a set M, M possesses a subset whose elements are exactly those x in M for which Sx holds.

Usage notes

The axiom schema of separation (also called the axiom schema of subset or axiom schema of specification) was introduced by Zermelo to avoid the paradoxes of naive set theory, particularly Russell's paradox. By restricting comprehension to subsets of an already existing set, it prevents the formation of "the set of all sets" or other inconsistent totalities. The modern formulation is: ∀A∃B∀x(x∈B↔x∈A∧Sx). The schema is actually infinite, with one instance for each well-formed formula Sx in which B does not occur free.

See also