Axiom schema of predicative separation

Axiom schema of predicative separation

In axiomatic set theory, the axiom schema of predicative separation, or of restricted, or Δ0 separation, is a schema of axioms which is a restriction of the usual axiom schema of separation in Zermelo-Fraenkel set theory. It only asserts the existence of a subset of a set if that subset can be defined without reference to the entire universe of sets. The axiom appears in the systems of constructive set theory CST and CZF, as well as in the system of Kripke-Platek set theory. The name Δ0 comes from the Lévy hierarchy (in analogy with the arithmetic hierarchy).

The formal statement of this is the same as full separation schema, but with a restriction on the formulas that may be used. For any formula φ:

:forall x ; exist y ; forall z ; (z in y leftrightarrow z in x wedge phi(z))

provided, as usual, that the variable "y" is not free in φ; but also provided that φ contains only bounded quantifiers. That is, all quantifiers in φ (if there are any) must appear in the form exist x in y ; psi(x) or forall x in y ; psi(x) for some sub-formula ψ.

The meaning of this is that, given any set "x", and any predicate φ there is a set "y" whose elements are the elements of "x" which satisfy φ, provided φ only quantifies over existing sets, and never quantifies over all sets. This restriction is necessary from a predicative point of view, since the universe of all sets contains the set being defined. If it were referenced in the definition of the set, the definition would be circular.

Although the schema contains one axiom for each restricted formula φ, it is possible in CZF to replace this schema with a finite number of axioms.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Théorème de Goodman-Myhill — Théorème de Diaconescu Le théorème de Diaconescu, ou le théorème de Goodman Myhill, énonce qu une forme du principe du tiers exclu, qui est rejeté dans les mathématiques constructives, est la conséquence du controversé axiome du choix dans la… …   Wikipédia en Français

  • New Foundations — In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled New Foundations for …   Wikipedia

  • Constructive set theory — is an approach to mathematical constructivism following the program of axiomatic set theory. That is, it uses the usual first order language of classical set theory, and although of course the logic is constructive, there is no explicit use of… …   Wikipedia

  • Morse–Kelley set theory — In the foundation of mathematics, Morse–Kelley set theory (MK) or Kelley–Morse set theory (KM) is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”