Axiom schema of specification

related topics
{math, number, function}
{group, member, jewish}

In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom schema of specification, axiom schema of separation, subset axiom scheme or axiom schema of restricted comprehension, is a schema of axioms in Zermelo-Fraenkel set theory. It is also called the axiom schema of comprehension, although that term is also used for unrestricted comprehension, discussed below. Essentially, it says that any definable subclass of a set is a set.

Contents

Statement

One instance of the schema is included for each formula φ in the language of set theory with free variables among x, w1, ... , wn, A. So B is not free in φ. In the formal language of set theory, the axiom schema is:

or in words:

Note that there is one axiom for every such predicate φ; thus, this is an axiom schema.

To understand this axiom schema, note that the set B must be a subset of A. Thus, what the axiom schema is really saying is that, given a set A and a predicate P, we can find a subset B of A whose members are precisely the members of A that satisfy P. By the axiom of extensionality this set is unique. We usually denote this set using set-builder notation as {CA : P(C)}. Thus the essence of the axiom is:

The axiom schema of specification is characteristic of systems of axiomatic set theory related to the usual set theory ZFC, but does not usually appear in radically different systems of alternative set theory. For example, New Foundations and positive set theory use different restrictions of the axiom of comprehension of naive set theory. The Alternative Set Theory of Vopenka makes a specific point of allowing proper subclasses of sets, called semisets. Even in systems related to ZFC, this scheme is sometimes restricted to formulas with bounded quantifiers, as in Kripke–Platek set theory with urelements.

Full article ▸

related documents
Horner scheme
NP-complete
Euler–Mascheroni constant
Convergence of random variables
Preadditive category
Linear map
Field extension
Universal property
Splay tree
Self-organizing map
Projective plane
Bubble sort
Spectral theorem
Euler–Maclaurin formula
Brute-force search
Hausdorff space
Rice's theorem
Binary tree
Logical connective
Additive category
Binary heap
Planar graph
Polymorphism in object-oriented programming
Isomorphism
Constructivism (mathematics)
Chinese remainder theorem
Cauchy–Schwarz inequality
Trace (linear algebra)
Locally compact space
Transcendental number