Axiomatic Set Theories

ZF (Zermelo-Frankel Set Theory)

Axioms:

  • Axiom of Extensionality: If the sets X and Y have the same elements, then X =Y
  • Axiom of Pairing: For any set x, y, then there exists a set {x, y}
  • Axiom Schema of Separation: Given any set Y and property , there is a subset X Y which contains exactly the elements in Y which satisfy
  • Axiom of Union: For any set X, there exists a set Y = , the union of all elements of X (or the set of elements of the sets in X)
  • Axiom of Powerset: For any set X, there exists a set Y = P(X), which the set of all subsets of X
  • Axiom of Infinity: There exists an infinite set. Formally, (a set built this way is called an inductive set)
  • Axiom Schema of Replacement: If class is a function, then for any set there exists a set , i.e., for any definable-class function the image of a set under this function is also a set
  • Axiom of Foundation: Every nonempty set has an -minimal element (i.e., for some ). Formally,

Other axiom(s)

  • Axiom of Choice: For every indexed family of nonempty sets, there exists an indexed set such that for every . Formally, Note: we must choose an element from each set in a family sets as required by the choice function , however, if we wish to ‘skip’ a set we merely take a subset which does not contain that particular set which we wish to ‘skip.’

axiom of choice is denoted

NBG (Von Neumann-Bernays-Gödel Set Theory)

axioms:

KP (Kripke-Platek Set Theory)

MK (Morse-Kelly Set Theory)

Properties of Theories

References

jech_03.pdf