|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In mathematics, the '''axiom of regularity''' (also known as the '''axiom of foundation''') is an axiom of [[Zermelo–Fraenkel set theory]] that states that every non-empty [[Set (mathematics)|set]] ''A'' contains an element that is disjoint from ''A''. In [[first-order logic]] the axiom reads:
| | == 物理的なスリルを == |
| : <math>\forall x\,(x \neq \varnothing \rightarrow \exist y \in x\,(y \cap x = \varnothing))</math>.
| |
| The axiom implies that no set is an element of itself, and that there is no infinite [[sequence]] (''a<sub>n</sub>'') such that ''a<sub>i+1</sub>'' is an element of ''a<sub>i</sub>'' for all ''i''. With the [[axiom of dependent choice]] (which is a weakened form of the [[axiom of choice]]), this result can be reversed: if there are no such infinite sequences, then the axiom of regularity is true. Hence, the axiom of regularity is equivalent, given the axiom of dependent choice, to the alternative axiom that there are no downward infinite membership chains.
| |
|
| |
|
| The axiom of regularity was introduced by {{harvtxt|von Neumann|1925}}; it was adopted in a formulation closer to the one found in contemporary textbooks by {{harvtxt|Zermelo|1930}}. Virtually all results in the branches of mathematics based on set theory hold even in the absence of regularity; see chapter 3 of {{harvtxt|Kunen|1980}}. However, regularity makes some properties of [[Ordinal number|ordinals]] easier to prove; and it not only allows induction to be done on [[well-ordering|well-ordered sets]] but also on proper classes that are [[well-founded relation|well-founded relational structures]] such as the [[lexicographical ordering]] on <math>\{ (n, \alpha) \vert n \in \omega \land \alpha \text{ is an ordinal } \} \,.</math>
| | それは日光に輝く、突然Duoliaoyifenかすかな光沢の上に排出シャオヤンの顔の集合体を共有するように浮き沈みの破裂、喉の集約ダウン最後のものはヒスイのような一枚のように、吐き出し、そして非常に魅力的な注意 [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-10.html カシオの時計]。<br>物理的なスリルを<br>あり、他のアクションは、シャオヤンはあぐらをかいて体が空にまっすぐ立っている春の一般的のようです座っていない、ねじれたツイストボディ、崔翔が少しヒントを拡大しそう上げ、彼の口の弧の間の骨だった [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-4.html カシオ 腕時計 バンド]。<br><br>ゆっくり手から、そっとシャオヤンをこすり二本の指は、突然、非常に弱い銀色「色」稲妻の線、それが前面に指からシューという音で結構です [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-9.html カシオ 掛け時計]。<br><br>「精錬の成功それは？ [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-7.html カシオソーラー時計] '小さな指Nalv雷を見て、シャオヤンの眉は、それを洗練風と雷を強制、タッチの外に喜びを抵抗することができず、彼の想像力はとても難しく、危険ではない、これらの優れた弟子の風と雷裁判所であり、それはこの中にある |
| | 相关的主题文章： |
| | <ul> |
| | |
| | <li>[http://www.midland-design.co.uk/cgi-bin/index.cgi http://www.midland-design.co.uk/cgi-bin/index.cgi]</li> |
| | |
| | <li>[http://www.zixunwang.cn/home.php?mod=space&uid=28197 http://www.zixunwang.cn/home.php?mod=space&uid=28197]</li> |
| | |
| | <li>[http://www.5231.net/home.php?mod=space&uid=491429 http://www.5231.net/home.php?mod=space&uid=491429]</li> |
| | |
| | </ul> |
|
| |
|
| Given the other axioms of Zermelo–Fraenkel set theory, the axiom of regularity is equivalent to the [[epsilon-induction|axiom of induction]]. The axiom of induction tends to be used in place of the axiom of regularity in [[intuitionism|intuitionistic]] theories (ones that do not accept the [[law of the excluded middle]]), where the two axioms are not equivalent.
| | == この弟子、古い '医学'、本当に静かに多くのことをやった == |
|
| |
|
| In addition to omitting the axiom of regularity, [[Non-well-founded set theory|non-standard set theories]] have indeed postulated the existence of sets that are elements of themselves.
| | 言った： [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-11.html 腕時計 メンズ casio] '、Danleiそうでない場合は、「色」残念ながら、この菩提ダンだけ挑発'薬 [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-6.html 電波腕時計 カシオ] 'の力が強くなりますが、あなたの体は菩提の心を持って、プラス菩提ダンのヘルプは、成功することができ、半神聖に躍進。 [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-5.html gps 腕時計 カシオ] '<br>古い古い顔が笑顔で覆われていることを「医学」を見て<br>、シャオヤンの心が多少ブロックされ、前者は二週間姿を消したそのうちのオリジナルは、この菩提ダンが出て洗練彼を助けるための場所を探して外出することであり、この、彼は今、成功率洗練されたダン「医学」のレベルの種類があまりにも低い数字ですが、彼も理解しているという「薬」古い容量、精錬菩提ダンは、十分な9「色」Danleiを誘致するためには、唯一の彼の手に骨がある場合、しかし、これが冷たい火のその後の精神、、あまり炎効果の一つである、9「カラー」Danlei描いた、行うことは非常に簡単です [http://www.nnyagdev.org/sitemap.xml http://www.nnyagdev.org/sitemap.xml]。<br>彼に<br>この弟子、古い [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-9.html casio 腕時計 ゴールド] '医学'、本当に静かに多くのことをやった。<br><br>「先生、ありがとうございました。 ' |
| | 相关的主题文章： |
| | <ul> |
| | |
| | <li>[http://www.putizi.net/bbs/home.php?mod=space&uid=46637 http://www.putizi.net/bbs/home.php?mod=space&uid=46637]</li> |
| | |
| | <li>[http://www.1-office.ru/cgi-bin/wgd.cgi http://www.1-office.ru/cgi-bin/wgd.cgi]</li> |
| | |
| | <li>[http://ew.sanuki.ne.jp/shizuka/cgi-bin/yybbs/yyregi.cgi http://ew.sanuki.ne.jp/shizuka/cgi-bin/yybbs/yyregi.cgi]</li> |
| | |
| | </ul> |
|
| |
|
| ==Elementary implications of regularity== | | == 」は、異なる火の三種類 == |
|
| |
|
| ===No set is an element of itself=== | | あなたの体の強さに私の魂を捨てレイ攻撃が長すぎることができないので、私はすぐに解決！ [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-7.html カシオ 掛け時計] '<br><br>Skyfireのりっぱなリマインダの声が突然シャオヤンの心に聞こえた [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-1.html カシオ スタンダード 腕時計]。<br><br>ウェンヤン、シャオヤンで少しうなずいた彼の頭には、火災時の額とインドでの軽く指は、すぐに、奇妙な白い炎森 [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-15.html カシオ ソーラー 腕時計] '色'をフック屈筋深呼吸を取り、それが急激に跳び。<br><br>骨冷たい火はリン、シャオヤンヤシの把握、グリーンスプリットや裸火、心臓の炎症が登場し、火明かりQinglianに分類されます [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-13.html 時計 カシオ]。<br><br>シャオヤン、3フレーム間の手のひらのグリップの最後の目の前に浮かぶ三つの異なる火災の体は、突然、デイトン時間を凝集力、暴力的なテロ力の高まり、広がって航海した [http://nrcil.net/sitemap.xml http://nrcil.net/sitemap.xml]。<br><br>」は、異なる火の三種類？どのようにそれができるか？ '<br><br>シャオヤンの3火炎面を参照してください、それははるかに気分張メイ長老トリオ振る持っていないようですが、それは顔である |
| Let ''A'' be a set, and apply the axiom of regularity to {''A''}, which is a set by the [[axiom of pairing]]. We see that there must be an element of {''A''} which is disjoint from {''A''}. Since the only element of {''A''} is ''A'', it must be that ''A'' is disjoint from {''A''}. So, since ''A'' ∈ {''A''}, we cannot have ''A'' ∈ ''A'' (by the definition of [[Disjoint sets|disjoint]]).
| | 相关的主题文章： |
| | <ul> |
| | |
| | <li>[http://2233777.cc/forum.php?mod=viewthread&tid=27212&extra= http://2233777.cc/forum.php?mod=viewthread&tid=27212&extra=]</li> |
| | |
| | <li>[http://90v-birds.com/tl-r/cgi/aska-in/aska.cgi http://90v-birds.com/tl-r/cgi/aska-in/aska.cgi]</li> |
| | |
| | <li>[http://www.buggywhipstudio.com/cgi-bin/storefront/buggywhip.cgi http://www.buggywhipstudio.com/cgi-bin/storefront/buggywhip.cgi]</li> |
| | |
| | </ul> |
|
| |
|
| ===No infinite descending sequence of sets exists=== | | == 、シャオヤンはやや無力なため息を思わ == |
| Suppose, to the contrary, that there is a [[function (mathematics)|function]], ''f'', on the [[natural number]]s with ''f''(''n''+1) an element of ''f''(''n'') for each ''n''. Define ''S'' = {''f''(''n''): ''n'' a natural number}, the range of ''f'', which can be seen to be a set from the [[axiom schema of replacement]]. Applying the axiom of regularity to ''S'', let ''B'' be an element of ''S'' which is disjoint from ''S''. By the definition of ''S'', ''B'' must be ''f''(''k'') for some natural number ''k''. However, we are given that ''f''(''k'') contains ''f''(''k''+1) which is also an element of ''S''. So ''f''(''k''+1) is in the intersection of ''f''(''k'') and ''S''. This contradicts the fact that they are disjoint sets. Since our supposition led to a contradiction, there must not be any such function, ''f''.
| |
|
| |
|
| The nonexistence of a set containing itself can be seen as a special case where the sequence is infinite and constant.
| | 「3人の若いマスターが、何が起こったのか？ [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-7.html casio 腕時計 説明書] 'シャオヤンは、彼の後ろに来て、すぐに功盛笑い、尋ねた、嘉Lieao、襲っペイン一見。<br><br>シャオヤンが顔片頭痛 [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-11.html カシオ腕時計 g-shock] '色'醜い嘉Lieaoを見て、微笑んで、何気なく言った： [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-15.html カシオ 腕時計 激安] '嘉Lieaoマスター、シティスクエアが、私xiaojiaサイト、あなたがここで手をしたいですか？'<br><br>嘉Lieaoペインの目は冷笑シャオヤンに転じ、その後、いくつかの恐怖を見て： '？したばかりの家族の影響に依存しないでください、あなたは男であれば...」<br><br>「私が男だった場合は、私が言いたい、あなたが公正なテストに来てください、それはないですか？ [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-0.html カシオ 腕時計 バンド] 'シャオヤンは突然嘉Lieao語を、振っ微笑んで中断。<br><br>嘉Lieaoの冷笑、挑発的と言った： [http://www.ispsc.edu.ph/nav/japandi/casio-rakuten-7.html カシオ 腕時計 gps] 'はい、あなたは勇気ができますか？'<br>挑発嘉Lieaoの顔を見<br>、シャオヤンはやや無力なため息を思わ |
| | | 相关的主题文章： |
| Notice that this argument only applies to functions ''f'' that can be represented as sets as opposed to undefinable classes. The [[hereditarily finite set]]s, V<sub>ω</sub>, satisfy the axiom of regularity (and all other axioms of [[ZFC]] except the [[axiom of infinity]]). So if one forms a non-trivial [[ultraproduct|ultrapower]] of V<sub>ω</sub>, then it will also satisfy the axiom of regularity. The resulting [[model (logic)|model]] <!--WHAT model?--> will contain elements, called non-standard natural numbers, that satisfy the definition of natural numbers in that model but are not really natural numbers. They are fake natural numbers which are "larger" than any actual natural number. This model will contain infinite descending sequences of elements. For example, suppose ''n'' is a non-standard natural number, then <math>(n-1) \in n</math> and <math>(n-2) \in (n-1)</math>, and so on. For any actual natural number ''k'', <math>(n-k-1) \in (n-k)</math>. This is an unending descending sequence of elements. But this sequence is not definable in the model and thus not a set. So no contradiction to regularity can be proved.
| | <ul> |
| | | |
| ===Simpler set-theoretic definition of the ordered pair===
| | <li>[http://wshear.dip.jp/ws/wsbbs/bbs.cgi http://wshear.dip.jp/ws/wsbbs/bbs.cgi]</li> |
| The axiom of regularity enables defining the ordered pair (''a'',''b'') as <nowiki>{</nowiki>''a'',<nowiki>{</nowiki>''a'',''b''<nowiki>}}</nowiki>. See [[ordered pair]] for specifics. This definition eliminates one pair of braces from the canonical [[Kuratowski]] definition (''a'',''b'') = <nowiki>{{</nowiki>''a''<nowiki>}</nowiki>,<nowiki>{</nowiki>''a'',''b''<nowiki>}}</nowiki>.
| | |
| | | <li>[http://maillists.freead.com.au/cgi-bin/mojo.cgi http://maillists.freead.com.au/cgi-bin/mojo.cgi]</li> |
| === Every set has an ordinal rank ===
| | |
| This was actually the original form of von Neumann's axiomatization.
| | <li>[http://www.imc-e.net/thread-1312060-1-1.html http://www.imc-e.net/thread-1312060-1-1.html]</li> |
| | | |
| === For every two sets, only one can be an element of the other ===
| | </ul> |
| Let ''X'' and ''Y'' be sets. Then apply the axiom of regularity to the set {''X'',''Y''}. We see there must be an element of {''X'',''Y''} which is also disjoint from it. It must be either ''X'' or ''Y''. By the definition of disjoint then, we must have either ''Y'' is not an element of ''X'' or vice versa.
| |
| | |
| ==The axiom of dependent choice and no infinite descending sequence of sets implies regularity==
| |
| Let the non-empty set ''S'' be a counter-example to the axiom of regularity; that is, every element of ''S'' has a non-empty intersection with ''S''. We define a binary relation ''R'' on ''S'' by <math>aRb :\Leftrightarrow b \in S \cap a</math>, which is entire by assumption. Thus, by the axiom of dependent choice, there is some sequence (''a<sub>n</sub>'') in ''S'' satisfying ''a<sub>n</sub>Ra<sub>n+1</sub>'' for all ''n'' in '''N'''. As this is an infinite descending chain, we arrive at a contradiction and so, no such ''S'' exists.
| |
| | |
| == Regularity and the rest of ZF(C) axioms ==
| |
| Regularity was shown to be relatively consistent with the rest of ZF by {{harvtxt|von Neumann|1929}}, meaning that if ZF without regularity is consistent, then ZF (with regularity) is also consistent. For his proof in modern notation see {{harvtxt|Vaught|2001|loc=§10.1}} for instance.
| |
| | |
| The axiom of regularity was also shown to be [[Independence (mathematical logic)|independent]] from the other axioms of ZF(C), assuming they are consistent. The result was announced by [[Paul Bernays]] in 1941, although he did not publish a proof until 1954. The proof involves (and led to the study of) [[Rieger-Bernays permutation]] models (or method), which were used for other proofs of independence for non-well-founded systems ({{harvnb|Rathjen|2004|p=193}} and {{harvnb|Forster|2003|pp=210–212}}).
| |
| | |
| == Regularity and Russell's paradox ==
| |
| [[Naive set theory]] (the axiom schema of [[unrestricted comprehension]] and the [[axiom of extensionality]]) is inconsistent due to [[Russell's paradox]]. Set theorists have avoided that contradiction by replacing the axiom schema of comprehension with the much weaker [[axiom schema of separation]]. However, this makes set theory too weak. So some of the power of comprehension was added back via the other existence axioms of ZF set theory (pairing, union, powerset, replacement, and infinity) which may be regarded as special cases of comprehension. So far, these axioms do not seem to lead to any contradiction. Subsequently, the axiom of choice and the axiom of regularity were added to exclude models with some undesirable properties. These two axioms are known to be relatively consistent.
| |
| | |
| In the presence of the axiom schema of separation, Russell's paradox becomes a proof that there is no [[universal set|set of all sets]]. The axiom of regularity (with the axiom of pairing) also prohibits such a universal set, however this prohibition is redundant when added to the rest of ZF. If the ZF axioms without regularity were already inconsistent, then adding regularity would not make them consistent.
| |
| | |
| The existence of [[Quine atom]]s (sets that satisfy the formula equation ''x'' = {''x''}, i.e. have themselves as their only elements) is consistent with the theory obtained by removing the axiom of regularity from ZFC. Various [[non-well-founded set theory|non-wellfounded set theories]] allow "safe" circular sets, such as Quine atoms, without becoming inconsistent by means of Russell's paradox.{{harv|Rieger|2011|pp=175,178}}
| |
| | |
| == Regularity, the cumulative hierarchy, and types ==
| |
| In ZF it can be proven that the class <math> \bigcup_{\alpha} V_\alpha \! </math> (see [[cumulative hierarchy]]) is equal to the class of all sets. This statement is even equivalent to the axiom of regularity (if we work in ZF with this axiom omitted). From any model which does not satisfy axiom of regularity, a model which satisfies it can be constructed by taking only sets in <math> \bigcup_{\alpha} V_\alpha \! </math>.
| |
| | |
| {{harvs|txt|last=Enderton|first=Herbert|year=1977|loc=p. 206|author-link=Herbert Enderton}} wrote that "The idea of rank is a descendant of Russell's concept of ''type''". Comparing ZF with [[type theory]], [[Alasdair Urquhart]] wrote that "Zermelo’s system has the notational advantage of not containing any explicitly typed variables, although in fact it can be seen as having an implicit type structure built into it, at least if the axiom of regularity is included. The details of this implicit typing are spelled out in [[#{{harvid|Zermelo|1930}}|[Zermelo 1930]]], and again in a well-known article of [[George Boolos]] [[#{{harvid|Boolos|1971}}|[Boolos 1971]]]." {{harvtxt|Urquhart|2003|p=305}}
| |
| | |
| {{harvs|txt|last=Scott|first=Dana|year=1974|authorlink=Dana Scott}} went further an claimed that: "The truth is that there is only one satisfactory way of avoiding the paradoxes: namely, the use of some form of the ''theory of types''. That was at the basis of both Russell's and Zermelo's intuitions. Indeed the best way to regard Zermelo's theory is as a simplification and extension of Russell's. (We mean Russell's ''simple'' theory of types, of course.) The simplification was to make the types ''cumulative''. Thus mixing of types is easier and annoying repetitions are avoided. Once the later types are allowed to accumulate the earlier ones, we can then easily imagine ''extending'' the types into the transfinite—just how far we want to go must necessarily be left open. Now Russell made his types ''explicit'' in his notation and Zermelo left them ''implicit''" (emphasis in original). In the same paper, Scott shows that an axiomatic system based on the inherent properties of the cumulative hierarchy turns out to be equivalent to ZF, including regularity. {{harv|Lévy|2002|p=73}}
| |
| | |
| == History ==
| |
| {{expand section|date=November 2012}}
| |
| The concept of well-foundedness and rank of a set were both introduced by [[Dmitry Mirimanoff]] ([[#{{harvid|Mirimanoff|1917}}|1917]]) cf. {{harvtxt|Lévy|2002|p=68}} and {{harvtxt|Hallett|1986|loc=§4.4, esp. p. 186, 188}}. Mirimanoff called a set ''x'' "regular" (French: "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 {{harv|Halbeisen|2012|pp=62–63}}; in later papers Mirimanoff also explored what are now called [[non-well-founded set theory|non-well-founded sets]] ("extraordinaire" in Mirimanoff's terminology) {{harv|Sangiorgi|2011|pp=17–19, 26}}.
| |
| | |
| According to Adam Rieger, {{harvtxt|von Neumann|1925}} describes non-well-founded sets as "superfluous" (on p. 404 in [[#{{harvid|van Heijenoort|1967}}|van Heijenoort 's translation]]) and in the same publication von Neumann gives an axiom (p. 412 in translation) which excludes some, but not all, non-well-founded sets {{harv|Rieger|2011|p=179}}. In a subsequent publication, {{harvtxt|von Neumann|1928}} gave the following axiom (rendered in modern notation by A. Rieger):
| |
| | |
| : <math>\forall x\,(x \neq \emptyset \rightarrow \exist y \in x\,(y \cap x = \emptyset))</math>.
| |
| | |
| ==See also==
| |
| *[[Non-well-founded set theory]]
| |
| | |
| == References ==
| |
| *{{Citation | last=Jech | first= Thomas |year= 2003 |title = Set Theory: The Third Millennium Edition, Revised and Expanded |publisher=Springer| isbn = 3-540-44085-2}}
| |
| *{{Citation | last=Kunen | first=Kenneth |year = 1980|title = Set Theory: An Introduction to Independence Proofs| publisher=Elsevier| isbn=0-444-86839-9}}
| |
| *{{citation|last=Boolos|first= George |year= 1971 | title = The iterative conception of set | journal = Journal of Philosophy | volume = 68 |pages= 215–231}} reprinted in {{citation|last=Boolos|first= George |year=1998|title=Logic, Logic and Logic|pages=13–29|publisher=Harvard University Press}}
| |
| *{{citation | last= Enderton | first = Herbert B. | title = Elements of Set Theory | publisher = Academic Press | year=1977}}
| |
| *{{citation|last = Urquhart|first = Alasdair | chapter = The Theory of Types | editor-last = Griffin| editor-first =Nicholas | title =The Cambridge Companion to Bertrand Russell | publisher = Cambridge University Press | year=2003}}
| |
| *{{citation| first= Lorenz J. |last = Halbeisen | title=Combinatorial Set Theory: With a Gentle Introduction to Forcing|year=2012|publisher=Springer}}
| |
| *{{citation| first = Davide | last = Sangiorgi | year = 2011 | chapter = Origins of bisimulation and coinduction | editor1-first = Davide | editor1-last = Sangiorgi | editor2-first = Jan | editor2-last = Rutten | title = Advanced Topics in Bisimulation and Coinduction | publisher = Cambridge University Press}}
| |
| *{{citation| last = Lévy | first =Azriel | isbn = 0486420795 | year =2002 |origyear= first published in 1979 | title=Basic set theory| publisher=Dover Publications}}
| |
| * {{citation|first=Michael|last=Hallett|title=Cantorian set theory and limitation of size|publisher=Oxford University Press|year=1996|origyear=first published 1984|isbn=0198532830}}
| |
| *{{citation|editor1-first=Godehard |editor1-last=Link|title=One Hundred Years of Russell ́s Paradox: Mathematics, Logic, Philosophy|year=2004|publisher=Walter de Gruyter|isbn=978-3-11-019968-0| chapter =Predicativity, Circularity, and Anti-Foundation | first = M. | last= Rathjen| url=http://www1.maths.leeds.ac.uk/~rathjen/russelle.pdf}}
| |
| *{{citation|title = Logic, induction and sets| last = Forster | first = T. | publisher = Cambridge University Press | year = 2003}}
| |
| * {{Citation
| |
| | last1 = Rieger | first1 = Adam
| |
| | chapter = Paradox, ZF, and the Axiom of Foundation
| |
| | doi = 10.1007/978-94-007-0214-1_9
| |
| | title = Logic, Mathematics, Philosophy, Vintage Enthusiasms. Essays in Honour of John L. Bell.
| |
| | editors = David DeVidi, Michael Hallett, Peter Clark
| |
| | series =
| |
| | volume =
| |
| | pages = 171–187
| |
| | year = 2011
| |
| | isbn = 978-94-007-0213-4
| |
| | pmid =
| |
| | pmc =
| |
| }}
| |
| * {{citation|first=Robert L. |last = Vaught|title=Set Theory: An Introduction| year=2001| publisher=Springer| isbn=978-0-8176-4256-3| edition=2nd}}
| |
| | |
| === Primary sources ===
| |
| *{{Citation | last1=Mirimanoff | first1=D. | title=Les antinomies de Russell et de Burali-Forti et le probleme fondamental de la theorie des ensembles | url=http://retro.seals.ch/digbib/view?rid=ensmat-001:1917:19::9&id=hitlist | year=1917 | journal=L'Enseignement Mathématique | volume=19|pages=37–52}}
| |
| *{{citation|last=von Neumann|first = J.|year=1925|title=Eine axiomatiserung der Mengenlehre|journal=Journal für die reine und angewandte Mathematik|volume=154|pages=219–240}}; translation in {{citation|last=van Heijenoort | first =Jean | year =1967 | title = From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 | pages = 393–413 }}
| |
| *{{citation|last = von Neumann|first = J.|year= 1928|title= Über die Definition durch transfinite Induktion und verwandte Fragen der allgemeinen Mengenlehre| journal= Mathematische Annalen|volume = 99 |pages=373–391|doi=10.1007/BF01459102}}
| |
| *{{citation| last = von Neumann |first = J. | year = 1929 | title= Uber eine Widerspruchfreiheitsfrage in der axiomatischen Mengenlehre| journal = Journal fur die reine und angewandte Mathematik |volume = 160 |pages = 227–241}}
| |
| *{{citation |last=Zermelo|first= Ernst |year= 1930 | title = Über Grenzzahlen und Mengenbereiche. Neue Untersuchungen über die Grundlagen der Mengenlehre. | journal = Fundamenta Mathematicae | volume = 16 |pages= 29–47|url=http://matwbn.icm.edu.pl/ksiazki/fm/fm16/fm1615.pdf}}; translation in {{citation | editor-last= Ewald |editor-first= W.B. | year = 1996| title = From Kant to Hilbert: A Source Book in the Foundations of Mathematics Vol. 2 | publisher= Clarendon Press |pages = 1219–33}}
| |
| * {{citation |first=P.|last= Bernays| title= A system of axiomatic set theory. Part II |journal= The Journal of Symbolic Logic| volume= 6 | year = 1941 | pages = 1–17}}
| |
| * {{citation | first= P.|last = Bernays| title= A system of axiomatic set theory. Part VII |journal = The Journal of Symbolic Logic| volume = 19 | year = 1954 | pages = 81–96}}
| |
| * {{citation | first = L. |last = Riegger | url = http://dml.cz/bitstream/handle/10338.dmlcz/100254/CzechMathJ_07-1957-3_1.pdf | title = A contribution to Gödel's axiomatic set theory | journal = Czechoslovak Mathematical Journal | volume = 7 | year = 1957 | pages = 323–357}}
| |
| * {{citation | last = Scott | first = D. | year = 1974 | chapter = Axiomatizing set theory | title = Axiomatic set theory. Proceedings of Symposia in Pure Mathematics Volume 13, Part II | pages = 207–214}}
| |
| | |
| ==External links==
| |
| *http://www.trinity.edu/cbrown/topics_in_logic/sets/sets.html contains an informative description of the axiom of regularity under the section on Zermelo-Fraenkel set theory.
| |
| *{{planetmath reference|id=3485|title=Axiom of Foundation}}
| |
| | |
| {{Set theory}}
| |
| | |
| {{DEFAULTSORT:Axiom Of Regularity}}
| |
| [[Category:Axioms of set theory]]
| |
| [[Category:Wellfoundedness]]
| |