Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Axiom of regularity
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== History == The concept of well-foundedness and [[Von Neumann universe|rank]] of a set were both introduced by [[Dmitry Mirimanoff]].{{sfn|Mirimanoff|1917}}<ref>cf. {{harvnb|LΓ©vy|2002|p=68}} and {{harvnb|Hallett|1996|loc=Β§4.4, esp. p. 186, 188}}.</ref> Mirimanoff called a set ''x'' "regular" ({{langx|fr|ordinaire}}) if every descending chain ''x'' β ''x''<sub>1</sub> β ''x''<sub>2</sub> β ... is finite. Mirimanoff however did not consider his notion of regularity (and well-foundedness) as an axiom to be observed by all sets;{{sfn|Halbeisen|2012|pp=62β63}} in later papers Mirimanoff also explored what are now called [[non-well-founded set theory|non-well-founded sets]] ({{lang|fr|extraordinaire}} in Mirimanoff's terminology).{{sfn|Sangiorgi|2011|pp=17β19, 26}} Skolem{{sfn|Skolem|1923}} and von Neumann{{sfn|von Neumann|1925}} pointed out that non-well-founded sets are superfluous{{sfn|van Heijenoort|1967|p=404}} and in the same publication von Neumann gives an axiom{{sfn|van Heijenoort|1967|p=412}} which excludes some, but not all, non-well-founded sets.{{sfn|Rieger|2011|p=179}} In a subsequent publication, von Neumann{{sfn|von Neumann|1929|p=231}} gave an equivalent but more complex version of the axiom of class foundation:<ref>cf. {{harvnb|Suppes|1972|p=53}} and {{harvnb|LΓ©vy|2002|p=72}}</ref> <math display="block"> A \neq \emptyset \rightarrow \exists x \in A\,(x \cap A = \emptyset).</math> The contemporary and final form of the axiom is due to Zermelo.{{sfn|Zermelo|1930}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)