To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

From Wikipedia, the free encyclopedia

In set theory, a branch of mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial') is an object that is not a set (has no elements), but that may be an element of a set. It is also referred to as an atom or individual. Ur-elements are also not identical with the empty set.

YouTube Encyclopedic

  • 1/3
    93 126
    18 104
    1 845
  • Set Theory - Introduction
  • Bertrand Russell, Set Theory and Russell's Paradox - Professor Tony Mann



There are several different but essentially equivalent ways to treat urelements in a first-order theory.

One way is to work in a first-order theory with two sorts, sets and urelements, with ab only defined when b is a set. In this case, if U is an urelement, it makes no sense to say , although is perfectly legitimate.

Another way is to work in a one-sorted theory with a unary relation used to distinguish sets and urelements. As non-empty sets contain members while urelements do not, the unary relation is only needed to distinguish the empty set from urelements. Note that in this case, the axiom of extensionality must be formulated to apply only to objects that are not urelements.

This situation is analogous to the treatments of theories of sets and classes. Indeed, urelements are in some sense dual to proper classes: urelements cannot have members whereas proper classes cannot be members. Put differently, urelements are minimal objects while proper classes are maximal objects by the membership relation (which, of course, is not an order relation, so this analogy is not to be taken literally).

Urelements in set theory

The Zermelo set theory of 1908 included urelements, and hence is a version now called ZFA or ZFCA (i.e. ZFA with axiom of choice).[1] It was soon realized that in the context of this and closely related axiomatic set theories, the urelements were not needed because they can easily be modeled in a set theory without urelements.[2] Thus, standard expositions of the canonical axiomatic set theories ZF and ZFC do not mention urelements (for an exception, see Suppes[3]). Axiomatizations of set theory that do invoke urelements include Kripke–Platek set theory with urelements and the variant of Von Neumann–Bernays–Gödel set theory described by Mendelson.[4] In type theory, an object of type 0 can be called an urelement; hence the name "atom".

Adding urelements to the system New Foundations (NF) to produce NFU has surprising consequences. In particular, Jensen proved[5] the consistency of NFU relative to Peano arithmetic; meanwhile, the consistency of NF relative to anything remains an open problem, pending verification of Holmes's proof of its consistency relative to ZF. Moreover, NFU remains relatively consistent when augmented with an axiom of infinity and the axiom of choice. Meanwhile, the negation of the axiom of choice is, curiously, an NF theorem. Holmes (1998) takes these facts as evidence that NFU is a more successful foundation for mathematics than NF. Holmes further argues that set theory is more natural with than without urelements, since we may take as urelements the objects of any theory or of the physical universe.[6] In finitist set theory, urelements are mapped to the lowest-level components of the target phenomenon, such as atomic constituents of a physical object or members of an organisation.

Quine atoms

An alternative approach to urelements is to consider them, instead of as a type of object other than sets, as a particular type of set. Quine atoms (named after Willard Van Orman Quine) are sets that only contain themselves, that is, sets that satisfy the formula x = {x}.[7]

Quine atoms cannot exist in systems of set theory that include the axiom of regularity, but they can exist in non-well-founded set theory. ZF set theory with the axiom of regularity removed cannot prove that any non-well-founded sets exist (unless it is inconsistent, in which case it will prove any arbitrary statement), but it is compatible with the existence of Quine atoms. Aczel's anti-foundation axiom implies that there is a unique Quine atom. Other non-well-founded theories may admit many distinct Quine atoms; at the opposite end of the spectrum lies Boffa's axiom of superuniversality, which implies that the distinct Quine atoms form a proper class.[8]

Quine atoms also appear in Quine's New Foundations, which allows more than one such set to exist.[9]

Quine atoms are the only sets called reflexive sets by Peter Aczel,[8] although other authors, e.g. Jon Barwise and Lawrence Moss, use the latter term to denote the larger class of sets with the property x ∈ x.[10]


  1. ^ Dexter Chua et al.: ZFA: Zermelo–Fraenkel set theory with atoms, on: nLab, revised on July 16, 2016.
  2. ^ Jech, Thomas J. (1973). The Axiom of Choice. Mineola, New York: Dover Publ. p. 45. ISBN 0486466248.
  3. ^ Suppes, Patrick (1972). Axiomatic Set Theory ([Éd. corr. et augm. du texte paru en 1960] ed.). New York: Dover Publ. ISBN 0486616304. Retrieved 17 September 2012.
  4. ^ Mendelson, Elliott (1997). Introduction to Mathematical Logic (4th ed.). London: Chapman & Hall. pp. 297–304. ISBN 978-0412808302. Retrieved 17 September 2012.
  5. ^ Jensen, Ronald Björn (December 1968). "On the Consistency of a Slight (?) Modification of Quine's 'New Foundations'". Synthese. 19 (1/2). Springer: 250–264. doi:10.1007/bf00568059. ISSN 0039-7857. JSTOR 20114640. S2CID 46960777.
  6. ^ Holmes, Randall, 1998. Elementary Set Theory with a Universal Set. Academia-Bruylant.
  7. ^ Thomas Forster (2003). Logic, Induction and Sets. Cambridge University Press. p. 199. ISBN 978-0-521-53361-4.
  8. ^ a b Aczel, Peter (1988), Non-well-founded sets, CSLI Lecture Notes, vol. 14, Stanford University, Center for the Study of Language and Information, p. 57, ISBN 0-937073-22-9, MR 0940014, retrieved 2016-10-17.
  9. ^ Barwise, Jon; Moss, Lawrence S. (1996), Vicious circles. On the mathematics of non-wellfounded phenomena, CSLI Lecture Notes, vol. 60, CSLI Publications, p. 306, ISBN 1575860090.
  10. ^ Barwise, Jon; Moss, Lawrence S. (1996), Vicious circles. On the mathematics of non-wellfounded phenomena, CSLI Lecture Notes, vol. 60, CSLI Publications, p. 57, ISBN 1575860090.

External links

This page was last edited on 9 November 2023, at 17:11
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.