Tarski–Grothendieck set theory

From Wikipedia, the free encyclopedia
  (Redirected from Tarski-Grothendieck set theory)
Jump to: navigation, search

Tarski–Grothendieck set theory (TG) is an axiomatic set theory that was introduced as part of the Mizar system for formal verification of proofs. Its characteristic axiom is Tarski's axiom (see below). The theory is a non-conservative extension of Zermelo–Fraenkel set theory. Tarski–Grothendieck set theory is named after mathematicians Alfred Tarski and Alexander Grothendieck.

Contents

[edit] Axioms

While the axioms and definitions defining Mizar's basic objects and processes are fully formal, they are described informally below.

TG includes the following standard definitions:

  • Singleton: A set with one member;
  • Unordered pair: A set with two distinct members. {a,b} = {b,a};
  • Ordered pair: The set \{\{a,b\},a\} = (a,b) \neq (b,a);
  • Subset: A set all of whose members are members of another given set;
  • The union of a family of sets Y: The set of all members of every member of Y.
Definitional axiom
  • Given any set A, the singleton {A} exists.
  • Given any two sets, their unordered and ordered pairs exist.
  • Given any family of sets, its union exists.

TG includes the following axioms, which are conventional because also part of ZFC:

Tarski's axiom (adapted from Tarski 1939[1]). For every set x, there exists a set y whose members include:

  • x itself;
  • every subset of every member of y;
  • the power set of every member of y;
  • every subset of y of cardinality less than that of y.

More formally: y [xy ∧ ∀zy [∀w (wzwy) ∧ ∃wyv (vzvw)] ∧ ∀z [zy → (zyzy)] ] or

y (xy ⋀ ∀zy (P(z) ⊆ y ⋀ ∃wy P(z) ⊆ w) ⋀ ∀zP(y)(zyzy)), where "P(x)" denotes the power class of x and "≈" denotes equinumerosity.

What Tarski's axiom states (in the vernacular) for each set x there is a Grothendieck universe it belongs to.

It is Tarski's axiom that distinguishes TG from other axiomatic set theories. Tarski's axiom also implies the axioms of infinity, choice,[2][3] and power set.[4][5] It also implies the existence of inaccessible cardinals, thanks to which the ontology of TG is much richer than that of conventional set theories such as ZFC.

[edit] See also

[edit] Notes

  1. ^ Tarski (1939)
  2. ^ Tarski (1938)
  3. ^ http://mmlquery.mizar.org/mml/current/wellord2.html#T26
  4. ^ Robert Solovay, Re: AC and strongly inaccessible cardinals.
  5. ^ Metamath grothpw.

[edit] References

[edit] External links

Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages