Knowledge

Talk:Axiom of infinity

Source πŸ“

356:
ZF matches everyone's intuitions about sets quite nicely. But it's precisely the various kinds of infinite sets that it's hard to have pre-theoretic intuitions about: everybody has encountered finite collections of physical objects, but nobody has encountered infinite collections, so it's a bit hard to have intuitions about how they should behave. The axiomatic approach is useful because it makes precise how all sets must behave, without having to rely on intuitions which people can disagree about. Most of the axioms say trivial things (e.g., "there is an empty set", which, by the way, does not mean the same as "there is no set" as you suggest) which are necessary for an approach based on logic where you want to be able to prove everything from first principles. The present axiom of infinity simply says that there exists a set with a certain recursive property. (It doesn't actually say that the set whose existence is postulated is infinite or is related in any way to the natural numbers. These notions require additional definitions and conventions.) The recursive property is explained in the article: the infinite set is such that if it contains a set
2511:) I believe my change is correct. Consider: it could be that ZFC-INFINITY is consistent, but ZFC is not. Then the axiom of infinity could not be derived from the other axioms, even though ZFC would be inconsistent, as claimed. Now the sentence could read "If ZFC without the axiom of infinity is consistent, then..." and this would also be correct, but I think that this weaker condition ought to be omitted. I don't know offhand what exactly it is, but the proof-theoretic strength of ZFC-INFINITY must be quite modest. -- 95: 85: 64: 31: 22: 396:). Note that the existence of sets which contain the empty set and finitely many successors follows from the other axioms of ZF. But it is not possible to prove the existence of a set which contains the empty set and all of its successors from the remaining axioms of ZF, hence the need for the present axiom which explicitly asserts that such a set exists. -- 3319:
The article says that I is a superset of the naturals. Could someone prove to me that this is? I mean, correct me if I am wrong, but β„• is such that 0 ∈ β„•, and βˆ€x ∈ β„•, successor(x) ∈ β„•. This seems to match very much with the definition of I, only that ΓΈ is used instead of 0, and x βˆͺ {x} is in place of
2967:
are a model of all of ZFC except the axiom of infinity. Thus, in particular, ZFC without the axiom of infinity is consistent and strictly weaker than ZFC with the axiom of infinity. Moreover, if one gets the details right, ZFC minus the axiom of infinity plus its negation is equiconsistent with Peano
355:
means. ZF is a single-sorted theory, i.e., it makes no distinction between set-variables and objects and non-set variables and objects. ZF simply says that certain sets exist (e.g. the empty set) and how to form sets from existing sets (e.g. pairing). It turns out that for finite, well-founded sets,
2973:
My take on the article text: I think it is better not to state an assumption of the consistency of ZFC when talking about the consistency of ZFC minus the axiom of infinity, since the latter is so much weaker. We do not say "if Peano arithmetic is consistent" very often, after all, as the IP editor
2942:
imply both the non-provability of Infinity and the non-provability of it negation from ZFC minus infinity. While it is true that your new formulation is slightly stronger while still being correct, the usual assumption people make when addressing independence questions in set theory is that all ZFC
2530:
correctly says, "a sentence Οƒ is called independent of a given first-order theory T if T neither proves nor refutes Οƒ; that is, it is impossible to prove Οƒ from T, and it is also impossible to prove from T that Οƒ is false". That is, for the axiom of infinity to be independent of the other axioms of
2915:
I will include it for now, but I still maintain that "if ZFC-Infinity is consistent" ought to be dropped. I seem to remember, but am not sure, that ZFC-Infinity is actually equiconsistent with PA. Yes, if PA is consistent, then it can't prove it's own consistency, but so what. There are some rare
636:
I was not thinking of any specific abnormal "natural numbers". Rather, I was thinking about how I would prove that the natural numbers have the kind of structure which they do have. You are correct, that I had forgotten a kind of argument which works for most properties. Although I think there is
280:
If you want to quantify both over first-order and second-order things you might want to make that convention or another which makes the distonction clear. Since we are working entirely in first-order here we don't need to restrict ourselves as to the variables which we use. Using a variable name
310:
I am not sure exactly what you mean by using the axiom schema of specification to remove unwanted elements. The schema allows one to remove elements from a set which do not satisfy a particular predicate. However as far as I can see, there is no such predicate applicable in this case.
593:
JRSpriggs - In what sense does the "intersection" formulation not ensure the limitation of the natural numbers? Given weak induction and ZFC we can basically prove all the second-order properties of natural numbers, since the power set axiom allows us to quantify over all subsets of
270: 556: 2916:
circumstances where we would bother to say "If PA is consistent" (like the previous sentence). But generally not, especially in the context of set theory. I mean, are we going to "fix" the ordinal articles with a bunch of caveats about "if epsilon-naught is well-founded"Β ? --
3134: 2860:. Thus we cannot be said to know with certainty that ZFC minus the axiom of infinity is consistent. If it turns out to be inconsistent, then it also implies the axiom of infinity which would contradict the sentence in your shortened form. Thus I will again revert you. 3289: 614:. I'm not sure I understand your reasoning here. Is it an issue of nonstandard models? Also, I thank you for your edits on the "Alternate" section, although I think it still needs work, since any reference to the actual axiom of infinity has been removed. 2482: 1856: 938: 1771:
in the last part of the above proof. Also, I think I can restructure my argument to say: There exists a unique set whose members are exactly those which are in every inductive set, i.e. the axiom of infinity + specification proves
1179: 1026: 314:
In fact, the "standard" way to do this is to just take all inductive subsets of some inductive set and find their intersection, but even this I believe to be fundamentally flawed (I'll not go into this here, though).
2213: 180: 418:
This set S may contain more than just the natural numbers, forming a subset of it, but we may apply the axiom schema of specification to remove unwanted elements, leaving the set N of all natural numbers.
437: 3002: 1951: 2850: 2752: 2657: 2055: 424:
To paraphrase: "Infinity asserts the existence of a superset of omega, separation can be used to get exactly omega." What predicate can be used to do this separation? -Dan 17:18, 24 May 2006 (UTC)
839: 3293:
as the arbitrary intersection of transitive sets is again transitive. Thus the natural numbers could be called the unique smallest transitive set. This is from Halmos. Naive Set Theory. 1960.
2143: 3184: 1997: 151: 1255: 3382: 2356: 2269: 1064: 776: 2563: 2943:
is consistent. I was just trying to make the simplest statement, to wit, consistency implies independence. I will leave your new version alone, if you do not change it further.
2407: 2382: 1555: 1319: 1404: 717: 394: 2083: 1588: 1489: 1352: 958:
Both constructions prove all three of these claims. To get trichotomy, what Enderton does in Elements of Set Theory is first he proves two straightforward lemmas: that
1775: 1621: 845: 685: 612: 3372: 1515: 1430: 1378: 1205: 2402: 2318: 2289: 353: 1456: 1281: 3387: 1769: 1749: 1697:
To Jayferd: You must revert your reversion of my change to your section. Proper classes are do not exist in ZFC; you cannot legitimately use them in any proof.
35: 562:
is a natural number iff it is either zero or a successor and each of its elements is either zero or a successor of another of its elements. This uses the
3397: 1086: 141: 3367: 3377: 117: 3392: 961: 2917: 2512: 2895:
If you still don't see it, then let's abstract. Let T be a theory and A an axiom, and suppose that T+A proves the consistency of T. Then:
2857: 1066:. It follows easily that at most one of the three trichotomy conditions holds. To show that at least one holds, he does the following: 265:{\displaystyle \exists x\lbrack \emptyset \in x\land \forall y(y\in x\rightarrow \cup \lbrace y,\lbrace y\rbrace \rbrace \in x)\rbrack } 687:- in the sense that any two systems which both satisfy the following three axioms (where 'Sx' means 'the successor of x', in our case 2147: 551:{\displaystyle \lbrack n=0\lor \exists y(n=y\prime )\rbrack \land \forall x\in n\lbrack x=0\lor \exists y\in n(x=y\prime )\rbrack \!} 3300: 3151: 2527: 108: 69: 3129:{\displaystyle \mathbb {N} :=\{T\in {\mathcal {P}}(I):\varnothing =T\vee (\varnothing \in T\wedge \forall x\in T\exists y\in T)\}} 3362: 667:
What I meant by the ZFC remark before was that any system which can prove the second-order Peano axioms completely determines
331:, which starts with first principles defined abstractly, regardless of pre-theoretic intuitions. The most common version is 1890: 2764: 2666: 2568: 2001: 3284:{\displaystyle \mathbb {N} :=\bigcap \{Z\in {\mathcal {P}}(I):\varnothing \in Z\wedge \forall x\in Z(x\cup \{x\}\in Z)\}} 44: 2878:
If so, then your reversion is still wrong! You either mean "If ZFC is consistent, then the axiom of infinity cannot be
332: 782: 2087: 323:
I'm not sure I fully understand what you're getting at. That said, it's clear that you're basing your discussion on
1955: 2921: 2516: 638: 2320:
is a logical symbol that means "false". It is often taken as an atomic formula that is identically false. So
1210: 2964: 3304: 3147: 2963:
Things we all probably know: the axiom of infinity cannot be derived from ZFC without infinity because the
2938:
Consistency of all ZFC implies consistency of ZFC minus the axiom of infinity. Thus the consistency of ZFC
2477:{\displaystyle n=\varnothing \Leftrightarrow \forall k\in n(\bot )\Leftrightarrow \forall k\in n(k\not =k)} 2323: 2236: 1031: 2660: 2493: 740: 50: 94: 3143: 2534: 3296: 3139: 328: 324: 1851:{\displaystyle \exists !\omega \forall x(x\in \omega \leftrightarrow \forall I(\Phi (I)\to x\in I))} 21: 3343: 3169: 2948: 2865: 2488: 2361: 2219: 1702: 1670: 1520: 1286: 933:{\displaystyle \forall A\subseteq \omega (0\in A\wedge \forall x(x\in A\to Sx\in A)\to A=\omega ).} 646: 577: 563: 401: 2531:
ZFC means that neither it nor its negation can be deduced from them. If ZFC is inconsistent, then
1859: 1624: 615: 116:
on Knowledge. If you would like to participate, please visit the project page, where you can join
3325: 2761:
Furthermore, the sentence "The axiom of infinity cannot be derived from the other axioms." means
1383: 174: 100: 690: 367: 84: 63: 2059: 1560: 1461: 1324: 1863: 1628: 619: 316: 292:
I don't want to, but the article does. I guess it is a convention of set builder notation? --
1593: 670: 597: 1494: 1409: 1357: 1184: 335:(ZF), which is a simple axiomatic theory, expressed in predicate logic, of what the symbol 2387: 2303: 2274: 338: 1435: 1260: 3339: 3165: 2944: 2861: 2292: 2215: 1698: 1666: 642: 581: 567: 397: 1754: 1734: 3356: 3321: 2981: 293: 273: 1174:{\displaystyle T=\{n\in \omega :(\forall m\in \omega )(m\in n\vee m=n\vee n\in m)\}} 2853: 2487:
This article, like many of the "axiom of ..." articles, could use a good cleaning.
281:
which has the right associations can help people a lot in understanding a formula.
2886:
is consistent, then the axiom of infinity cannot be derived from the other axioms"
3164:
contains the empty set, then it cannot have all of its members being successors.
282: 113: 90: 3347: 3329: 3308: 3173: 2986: 2952: 2925: 2869: 2520: 2497: 2295: 2223: 1867: 1706: 1674: 1632: 650: 623: 584: 570: 405: 2977: 1021:{\displaystyle \forall m\forall n(m\in n\leftrightarrow m^{+}\in n^{+})} 1883:(unindent) OK, I see how it is done now. The inductive hypotheses, on 637:
still some difficulty proving that the natural numbers under ∈ are
2906:
Correct? Now A is the axiom of infinity, and T is the rest of ZFC.
1653:
Could you expand and clarify that last part a little? Where does
327:, which is not what this article is about. This article is about 2208:{\displaystyle \forall m\in \omega (m\in n\lor m=n\lor n\in m).} 307:
What specification are you using to remove unwanted elements?
15: 2852:
However, ZFC minus the axiom of infinity already implies the
360:, then it also contains what you might call the successor of 3210: 3025: 537: 474: 2509: 1946:{\displaystyle n=0\lor \exists m\in \omega (n=m^{+}),} 414:
You might be missing the point here. The article says
3187: 3005: 2845:{\displaystyle (ZFC-Infinity)\not \vdash Infinity\,.} 2767: 2747:{\displaystyle (ZFC-Infinity)\vdash \lnot Infinity\,} 2669: 2652:{\displaystyle (ZFC-Infinity)+Infinity\vdash \bot \,} 2571: 2537: 2410: 2390: 2364: 2326: 2306: 2277: 2239: 2150: 2090: 2062: 2050:{\displaystyle \forall m\in n\forall k\in m(k\in n),} 2004: 1958: 1893: 1778: 1757: 1737: 1596: 1563: 1523: 1497: 1464: 1438: 1412: 1386: 1360: 1327: 1289: 1263: 1213: 1187: 1089: 1034: 964: 848: 785: 743: 693: 673: 600: 440: 370: 341: 183: 112:, a collaborative effort to improve the coverage of 173:Q: aren't capital names and variables reserved for 3283: 3128: 2844: 2746: 2651: 2557: 2476: 2396: 2376: 2350: 2312: 2283: 2263: 2207: 2137: 2077: 2049: 1991: 1945: 1850: 1763: 1743: 1615: 1582: 1549: 1509: 1483: 1450: 1424: 1398: 1372: 1346: 1313: 1275: 1249: 1199: 1173: 1058: 1020: 932: 833: 770: 711: 679: 606: 550: 388: 347: 264: 3335:It does NOT say that I β‰  N; is that your problem? 1406:, we have two cases by inductive assumption. If 2901:T+A is inconsistent iff A can be refuted from T. 834:{\displaystyle \forall x\forall y(Sx=Sy\to x=y)} 3383:Knowledge level-5 vital articles in Mathematics 2138:{\displaystyle \forall m\in n(m^{+}\in n^{+}),} 1858:. My bad for revising without checking first. 1731:To JRSpriggs - My bad on both counts. Changed 546: 2898:T is inconsistent iff A can be derived from T. 1992:{\displaystyle \forall m\in n(m\in \omega ),} 8: 3278: 3266: 3260: 3199: 3123: 3108: 3102: 3014: 1168: 1096: 706: 700: 578:Talk:Natural number#Set theoretic definition 543: 498: 480: 441: 383: 377: 259: 247: 244: 238: 229: 190: 303:Specification to remove unwanted elements? 58: 3209: 3208: 3189: 3188: 3186: 3024: 3023: 3007: 3006: 3004: 2993:Alternative Extraction of Natural Numbers 2766: 2668: 2570: 2536: 2409: 2389: 2363: 2325: 2305: 2276: 2238: 2149: 2123: 2110: 2089: 2061: 2003: 1957: 1931: 1892: 1777: 1756: 1736: 1601: 1595: 1568: 1562: 1541: 1528: 1522: 1496: 1475: 1463: 1437: 1411: 1385: 1359: 1338: 1326: 1288: 1262: 1250:{\displaystyle \forall x(x=0\vee 0\in x)} 1212: 1186: 1088: 1033: 1009: 996: 963: 847: 784: 742: 692: 672: 599: 439: 369: 340: 182: 3373:Knowledge vital articles in Mathematics 3227: 3057: 3042: 2997:Can't we define the naturals this way? 2837: 2754:and thus that the axiom of infinity is 2742: 2647: 2553: 2417: 2371: 1887:, which one might want to use include: 60: 19: 3338:So what? Is that not what you expect? 3388:C-Class vital articles in Mathematics 2351:{\displaystyle \forall k\in n(\bot )} 2264:{\displaystyle \forall k\in n(\bot )} 169:Capitalization and second order logic 7: 1059:{\displaystyle \forall n(n\notin n)} 106:This article is within the scope of 2856:which, as you know, are subject to 771:{\displaystyle \forall x(Sx\neq 0)} 49:It is of interest to the following 3239: 3081: 3069: 2715: 2644: 2550: 2447: 2438: 2423: 2391: 2342: 2327: 2307: 2278: 2255: 2240: 2151: 2091: 2017: 2005: 1959: 1906: 1818: 1809: 1788: 1779: 1657:appear after your assumption that 1214: 1114: 1035: 971: 965: 876: 849: 792: 786: 744: 513: 486: 456: 205: 193: 184: 14: 3398:Low-priority mathematics articles 2884:ZFC without the axiom of infinity 2558:{\displaystyle ZFC\vdash \bot \,} 2528:Independence (mathematical logic) 430:Ο‰ is the set of natural numbers. 126:Knowledge:WikiProject Mathematics 3368:Knowledge level-5 vital articles 2404:can be simulated by not equals: 129:Template:WikiProject Mathematics 93: 83: 62: 29: 20: 2858:GΓΆdel's incompleteness theorems 1623:; in either case we are done. 1181:is inductive. First, we claim 146:This article has been rated as 3378:C-Class level-5 vital articles 3275: 3251: 3221: 3215: 3120: 3117: 3093: 3054: 3036: 3030: 2882:from the other axioms" or "If 2807: 2768: 2709: 2670: 2611: 2572: 2471: 2459: 2444: 2441: 2435: 2420: 2384:. In a theory with equality, 2377:{\displaystyle n=\varnothing } 2345: 2339: 2258: 2252: 2199: 2163: 2129: 2103: 2041: 2029: 1983: 1971: 1937: 1918: 1845: 1842: 1830: 1827: 1821: 1815: 1806: 1794: 1550:{\displaystyle x^{+}\in m^{+}} 1314:{\displaystyle x=0\vee 0\in x} 1244: 1220: 1165: 1129: 1126: 1111: 1053: 1041: 1015: 989: 977: 924: 912: 909: 894: 882: 861: 828: 816: 798: 765: 750: 540: 525: 477: 462: 256: 223: 211: 1: 3348:23:29, 18 November 2023 (UTC) 3330:21:17, 17 November 2023 (UTC) 3179:A valid alternative would be 2953:17:57, 28 February 2009 (UTC) 2926:16:29, 28 February 2009 (UTC) 2870:14:00, 28 February 2009 (UTC) 2521:08:04, 28 February 2009 (UTC) 120:and see a list of open tasks. 3393:C-Class mathematics articles 1399:{\displaystyle m\in \omega } 576:There is more about this at 2229:what does this symbol mean? 712:{\displaystyle x\cup \{x\}} 389:{\displaystyle x\cup \{x\}} 333:Zermelo-Fraenkel set theory 3414: 2078:{\displaystyle n\notin n,} 1583:{\displaystyle x^{+}\in m} 1484:{\displaystyle m\in x^{+}} 1347:{\displaystyle 0\in x^{+}} 651:10:21, 24 April 2009 (UTC) 624:17:27, 23 April 2009 (UTC) 406:08:04, 29 April 2006 (UTC) 276:01:54, Apr 25, 2005 (UTC) 2498:17:25, 8 March 2007 (UTC) 2296:16:55, 8 March 2007 (UTC) 571:06:34, 26 June 2006 (UTC) 434:is a natural number iff 296:15:11, Apr 27, 2005 (UTC) 145: 78: 57: 3309:04:50, 25 May 2013 (UTC) 3174:14:49, 22 May 2013 (UTC) 2974:has pointed out. β€”Β Carl 2965:hereditarily finite sets 2504:If ZFC is consistent ... 2224:23:47, 11 May 2009 (UTC) 585:04:55, 1 July 2006 (UTC) 319:9 July 2005 12:45 (UTC) 285:12:13, 27 Apr 2005 (UTC) 152:project's priority scale 2987:19:59, 6 May 2009 (UTC) 1868:00:35, 8 May 2009 (UTC) 1707:19:03, 6 May 2009 (UTC) 1675:19:03, 6 May 2009 (UTC) 1633:03:08, 6 May 2009 (UTC) 1616:{\displaystyle x^{+}=m} 680:{\displaystyle \omega } 607:{\displaystyle \omega } 109:WikiProject Mathematics 3363:C-Class vital articles 3285: 3130: 2846: 2748: 2653: 2559: 2478: 2398: 2378: 2352: 2314: 2285: 2265: 2209: 2139: 2079: 2051: 1993: 1947: 1852: 1765: 1745: 1617: 1584: 1551: 1511: 1510:{\displaystyle x\in m} 1485: 1452: 1426: 1425:{\displaystyle m\in x} 1400: 1374: 1373:{\displaystyle x\in T} 1348: 1315: 1277: 1251: 1201: 1200:{\displaystyle 0\in T} 1175: 1060: 1022: 934: 835: 772: 713: 681: 608: 552: 390: 349: 266: 3286: 3131: 2847: 2749: 2661:deduction metatheorem 2654: 2565:which is the same as 2560: 2479: 2399: 2397:{\displaystyle \bot } 2379: 2353: 2315: 2313:{\displaystyle \bot } 2286: 2284:{\displaystyle \bot } 2266: 2210: 2140: 2080: 2052: 1994: 1948: 1853: 1766: 1746: 1618: 1585: 1552: 1512: 1486: 1453: 1427: 1401: 1375: 1349: 1316: 1278: 1252: 1202: 1176: 1061: 1023: 935: 836: 773: 719:) will be isomorphic: 714: 682: 609: 553: 391: 350: 267: 36:level-5 vital article 3185: 3003: 2765: 2667: 2569: 2535: 2408: 2388: 2362: 2324: 2304: 2275: 2237: 2148: 2088: 2060: 2002: 1956: 1891: 1776: 1755: 1735: 1594: 1561: 1521: 1495: 1462: 1436: 1410: 1384: 1358: 1325: 1321:then in either case 1287: 1261: 1211: 1185: 1087: 1032: 962: 846: 783: 741: 691: 671: 598: 438: 368: 348:{\displaystyle \in } 339: 329:axiomatic set theory 325:intuitive set theory 181: 132:mathematics articles 2271:mean? What is the 1451:{\displaystyle m=x} 1354:. Now assume that 1276:{\displaystyle 0=0} 564:axiom of regularity 3281: 3126: 2842: 2838: 2744: 2743: 2649: 2648: 2555: 2554: 2474: 2394: 2374: 2348: 2310: 2281: 2261: 2205: 2135: 2075: 2047: 1989: 1943: 1848: 1761: 1741: 1613: 1580: 1547: 1517:then by the lemma 1507: 1481: 1448: 1422: 1396: 1370: 1344: 1311: 1273: 1247: 1197: 1171: 1056: 1018: 930: 831: 768: 709: 677: 604: 548: 547: 386: 364:(which is the set 345: 262: 175:second-order logic 101:Mathematics portal 45:content assessment 3299:comment added by 3156: 3142:comment added by 2985: 2496: 1764:{\displaystyle x} 1744:{\displaystyle k} 404: 402:(call me collect) 166: 165: 162: 161: 158: 157: 3405: 3311: 3290: 3288: 3287: 3282: 3214: 3213: 3192: 3155: 3136: 3135: 3133: 3132: 3127: 3029: 3028: 3010: 2975: 2851: 2849: 2848: 2843: 2753: 2751: 2750: 2745: 2658: 2656: 2655: 2650: 2564: 2562: 2561: 2556: 2492: 2483: 2481: 2480: 2475: 2403: 2401: 2400: 2395: 2383: 2381: 2380: 2375: 2357: 2355: 2354: 2349: 2319: 2317: 2316: 2311: 2290: 2288: 2287: 2282: 2270: 2268: 2267: 2262: 2214: 2212: 2211: 2206: 2144: 2142: 2141: 2136: 2128: 2127: 2115: 2114: 2084: 2082: 2081: 2076: 2056: 2054: 2053: 2048: 1998: 1996: 1995: 1990: 1952: 1950: 1949: 1944: 1936: 1935: 1857: 1855: 1854: 1849: 1770: 1768: 1767: 1762: 1750: 1748: 1747: 1742: 1622: 1620: 1619: 1614: 1606: 1605: 1589: 1587: 1586: 1581: 1573: 1572: 1556: 1554: 1553: 1548: 1546: 1545: 1533: 1532: 1516: 1514: 1513: 1508: 1490: 1488: 1487: 1482: 1480: 1479: 1457: 1455: 1454: 1449: 1431: 1429: 1428: 1423: 1405: 1403: 1402: 1397: 1379: 1377: 1376: 1371: 1353: 1351: 1350: 1345: 1343: 1342: 1320: 1318: 1317: 1312: 1282: 1280: 1279: 1274: 1256: 1254: 1253: 1248: 1206: 1204: 1203: 1198: 1180: 1178: 1177: 1172: 1065: 1063: 1062: 1057: 1027: 1025: 1024: 1019: 1014: 1013: 1001: 1000: 939: 937: 936: 931: 840: 838: 837: 832: 777: 775: 774: 769: 718: 716: 715: 710: 686: 684: 683: 678: 613: 611: 610: 605: 557: 555: 554: 549: 400: 395: 393: 392: 387: 354: 352: 351: 346: 271: 269: 268: 263: 134: 133: 130: 127: 124: 103: 98: 97: 87: 80: 79: 74: 66: 59: 42: 33: 32: 25: 24: 16: 3413: 3412: 3408: 3407: 3406: 3404: 3403: 3402: 3353: 3352: 3317: 3294: 3183: 3182: 3137: 3001: 3000: 2995: 2763: 2762: 2665: 2664: 2567: 2566: 2533: 2532: 2506: 2406: 2405: 2386: 2385: 2360: 2359: 2322: 2321: 2302: 2301: 2273: 2272: 2235: 2234: 2231: 2146: 2145: 2119: 2106: 2086: 2085: 2058: 2057: 2000: 1999: 1954: 1953: 1927: 1889: 1888: 1774: 1773: 1753: 1752: 1733: 1732: 1597: 1592: 1591: 1564: 1559: 1558: 1537: 1524: 1519: 1518: 1493: 1492: 1471: 1460: 1459: 1434: 1433: 1408: 1407: 1382: 1381: 1356: 1355: 1334: 1323: 1322: 1285: 1284: 1259: 1258: 1257:. But clearly 1209: 1208: 1183: 1182: 1085: 1084: 1030: 1029: 1005: 992: 960: 959: 844: 843: 781: 780: 739: 738: 689: 688: 669: 668: 596: 595: 436: 435: 366: 365: 337: 336: 305: 179: 178: 171: 131: 128: 125: 122: 121: 99: 92: 72: 43:on Knowledge's 40: 30: 12: 11: 5: 3411: 3409: 3401: 3400: 3395: 3390: 3385: 3380: 3375: 3370: 3365: 3355: 3354: 3351: 3350: 3336: 3320:successor(x). 3316: 3313: 3280: 3277: 3274: 3271: 3268: 3265: 3262: 3259: 3256: 3253: 3250: 3247: 3244: 3241: 3238: 3235: 3232: 3229: 3226: 3223: 3220: 3217: 3212: 3207: 3204: 3201: 3198: 3195: 3191: 3177: 3176: 3160:Not quite. If 3125: 3122: 3119: 3116: 3113: 3110: 3107: 3104: 3101: 3098: 3095: 3092: 3089: 3086: 3083: 3080: 3077: 3074: 3071: 3068: 3065: 3062: 3059: 3056: 3053: 3050: 3047: 3044: 3041: 3038: 3035: 3032: 3027: 3022: 3019: 3016: 3013: 3009: 2994: 2991: 2990: 2989: 2970: 2969: 2960: 2959: 2958: 2957: 2956: 2955: 2931: 2930: 2929: 2928: 2918:99.245.206.188 2910: 2909: 2908: 2907: 2904: 2903: 2902: 2899: 2890: 2889: 2888: 2887: 2873: 2872: 2841: 2836: 2833: 2830: 2827: 2824: 2821: 2818: 2815: 2812: 2809: 2806: 2803: 2800: 2797: 2794: 2791: 2788: 2785: 2782: 2779: 2776: 2773: 2770: 2759: 2741: 2738: 2735: 2732: 2729: 2726: 2723: 2720: 2717: 2714: 2711: 2708: 2705: 2702: 2699: 2696: 2693: 2690: 2687: 2684: 2681: 2678: 2675: 2672: 2659:which (by the 2646: 2643: 2640: 2637: 2634: 2631: 2628: 2625: 2622: 2619: 2616: 2613: 2610: 2607: 2604: 2601: 2598: 2595: 2592: 2589: 2586: 2583: 2580: 2577: 2574: 2552: 2549: 2546: 2543: 2540: 2513:99.245.206.188 2505: 2502: 2501: 2500: 2485: 2473: 2470: 2467: 2464: 2461: 2458: 2455: 2452: 2449: 2446: 2443: 2440: 2437: 2434: 2431: 2428: 2425: 2422: 2419: 2416: 2413: 2393: 2373: 2370: 2367: 2347: 2344: 2341: 2338: 2335: 2332: 2329: 2309: 2280: 2260: 2257: 2254: 2251: 2248: 2245: 2242: 2230: 2227: 2204: 2201: 2198: 2195: 2192: 2189: 2186: 2183: 2180: 2177: 2174: 2171: 2168: 2165: 2162: 2159: 2156: 2153: 2134: 2131: 2126: 2122: 2118: 2113: 2109: 2105: 2102: 2099: 2096: 2093: 2074: 2071: 2068: 2065: 2046: 2043: 2040: 2037: 2034: 2031: 2028: 2025: 2022: 2019: 2016: 2013: 2010: 2007: 1988: 1985: 1982: 1979: 1976: 1973: 1970: 1967: 1964: 1961: 1942: 1939: 1934: 1930: 1926: 1923: 1920: 1917: 1914: 1911: 1908: 1905: 1902: 1899: 1896: 1881: 1880: 1879: 1878: 1877: 1876: 1875: 1874: 1873: 1872: 1871: 1870: 1847: 1844: 1841: 1838: 1835: 1832: 1829: 1826: 1823: 1820: 1817: 1814: 1811: 1808: 1805: 1802: 1799: 1796: 1793: 1790: 1787: 1784: 1781: 1760: 1740: 1718: 1717: 1716: 1715: 1714: 1713: 1712: 1711: 1710: 1709: 1686: 1685: 1684: 1683: 1682: 1681: 1680: 1679: 1678: 1677: 1642: 1641: 1640: 1639: 1638: 1637: 1636: 1635: 1612: 1609: 1604: 1600: 1579: 1576: 1571: 1567: 1544: 1540: 1536: 1531: 1527: 1506: 1503: 1500: 1478: 1474: 1470: 1467: 1447: 1444: 1441: 1421: 1418: 1415: 1395: 1392: 1389: 1369: 1366: 1363: 1341: 1337: 1333: 1330: 1310: 1307: 1304: 1301: 1298: 1295: 1292: 1272: 1269: 1266: 1246: 1243: 1240: 1237: 1234: 1231: 1228: 1225: 1222: 1219: 1216: 1196: 1193: 1190: 1170: 1167: 1164: 1161: 1158: 1155: 1152: 1149: 1146: 1143: 1140: 1137: 1134: 1131: 1128: 1125: 1122: 1119: 1116: 1113: 1110: 1107: 1104: 1101: 1098: 1095: 1092: 1083:We claim that 1074: 1073: 1072: 1071: 1070: 1069: 1068: 1067: 1055: 1052: 1049: 1046: 1043: 1040: 1037: 1017: 1012: 1008: 1004: 999: 995: 991: 988: 985: 982: 979: 976: 973: 970: 967: 949: 948: 947: 946: 945: 944: 943: 942: 941: 940: 929: 926: 923: 920: 917: 914: 911: 908: 905: 902: 899: 896: 893: 890: 887: 884: 881: 878: 875: 872: 869: 866: 863: 860: 857: 854: 851: 841: 830: 827: 824: 821: 818: 815: 812: 809: 806: 803: 800: 797: 794: 791: 788: 778: 767: 764: 761: 758: 755: 752: 749: 746: 727: 726: 725: 724: 723: 722: 721: 720: 708: 705: 702: 699: 696: 676: 658: 657: 656: 655: 654: 653: 629: 628: 627: 626: 603: 588: 587: 545: 542: 539: 536: 533: 530: 527: 524: 521: 518: 515: 512: 509: 506: 503: 500: 497: 494: 491: 488: 485: 482: 479: 476: 473: 470: 467: 464: 461: 458: 455: 452: 449: 446: 443: 428: 427: 426: 425: 422: 421: 420: 409: 408: 385: 382: 379: 376: 373: 344: 304: 301: 300: 299: 298: 297: 287: 286: 261: 258: 255: 252: 249: 246: 243: 240: 237: 234: 231: 228: 225: 222: 219: 216: 213: 210: 207: 204: 201: 198: 195: 192: 189: 186: 170: 167: 164: 163: 160: 159: 156: 155: 144: 138: 137: 135: 118:the discussion 105: 104: 88: 76: 75: 67: 55: 54: 48: 26: 13: 10: 9: 6: 4: 3: 2: 3410: 3399: 3396: 3394: 3391: 3389: 3386: 3384: 3381: 3379: 3376: 3374: 3371: 3369: 3366: 3364: 3361: 3360: 3358: 3349: 3345: 3341: 3337: 3334: 3333: 3332: 3331: 3327: 3323: 3314: 3312: 3310: 3306: 3302: 3298: 3291: 3272: 3269: 3263: 3257: 3254: 3248: 3245: 3242: 3236: 3233: 3230: 3224: 3218: 3205: 3202: 3196: 3193: 3180: 3175: 3171: 3167: 3163: 3159: 3158: 3157: 3153: 3149: 3145: 3141: 3114: 3111: 3105: 3099: 3096: 3090: 3087: 3084: 3078: 3075: 3072: 3066: 3063: 3060: 3051: 3048: 3045: 3039: 3033: 3020: 3017: 3011: 2998: 2992: 2988: 2983: 2979: 2972: 2971: 2966: 2962: 2961: 2954: 2950: 2946: 2941: 2937: 2936: 2935: 2934: 2933: 2932: 2927: 2923: 2919: 2914: 2913: 2912: 2911: 2905: 2900: 2897: 2896: 2894: 2893: 2892: 2891: 2885: 2881: 2877: 2876: 2875: 2874: 2871: 2867: 2863: 2859: 2855: 2839: 2834: 2831: 2828: 2825: 2822: 2819: 2816: 2813: 2810: 2804: 2801: 2798: 2795: 2792: 2789: 2786: 2783: 2780: 2777: 2774: 2771: 2760: 2757: 2739: 2736: 2733: 2730: 2727: 2724: 2721: 2718: 2712: 2706: 2703: 2700: 2697: 2694: 2691: 2688: 2685: 2682: 2679: 2676: 2673: 2662: 2641: 2638: 2635: 2632: 2629: 2626: 2623: 2620: 2617: 2614: 2608: 2605: 2602: 2599: 2596: 2593: 2590: 2587: 2584: 2581: 2578: 2575: 2547: 2544: 2541: 2538: 2529: 2525: 2524: 2523: 2522: 2518: 2514: 2510: 2503: 2499: 2495: 2490: 2486: 2468: 2465: 2462: 2456: 2453: 2450: 2432: 2429: 2426: 2414: 2411: 2368: 2365: 2336: 2333: 2330: 2300: 2299: 2298: 2297: 2294: 2249: 2246: 2243: 2228: 2226: 2225: 2221: 2217: 2202: 2196: 2193: 2190: 2187: 2184: 2181: 2178: 2175: 2172: 2169: 2166: 2160: 2157: 2154: 2132: 2124: 2120: 2116: 2111: 2107: 2100: 2097: 2094: 2072: 2069: 2066: 2063: 2044: 2038: 2035: 2032: 2026: 2023: 2020: 2014: 2011: 2008: 1986: 1980: 1977: 1974: 1968: 1965: 1962: 1940: 1932: 1928: 1924: 1921: 1915: 1912: 1909: 1903: 1900: 1897: 1894: 1886: 1869: 1865: 1861: 1839: 1836: 1833: 1824: 1812: 1803: 1800: 1797: 1791: 1785: 1782: 1758: 1738: 1730: 1729: 1728: 1727: 1726: 1725: 1724: 1723: 1722: 1721: 1720: 1719: 1708: 1704: 1700: 1696: 1695: 1694: 1693: 1692: 1691: 1690: 1689: 1688: 1687: 1676: 1672: 1668: 1664: 1660: 1656: 1652: 1651: 1650: 1649: 1648: 1647: 1646: 1645: 1644: 1643: 1634: 1630: 1626: 1610: 1607: 1602: 1598: 1577: 1574: 1569: 1565: 1542: 1538: 1534: 1529: 1525: 1504: 1501: 1498: 1476: 1472: 1468: 1465: 1445: 1442: 1439: 1419: 1416: 1413: 1393: 1390: 1387: 1367: 1364: 1361: 1339: 1335: 1331: 1328: 1308: 1305: 1302: 1299: 1296: 1293: 1290: 1270: 1267: 1264: 1241: 1238: 1235: 1232: 1229: 1226: 1223: 1217: 1194: 1191: 1188: 1162: 1159: 1156: 1153: 1150: 1147: 1144: 1141: 1138: 1135: 1132: 1123: 1120: 1117: 1108: 1105: 1102: 1099: 1093: 1090: 1082: 1081: 1080: 1079: 1078: 1077: 1076: 1075: 1050: 1047: 1044: 1038: 1010: 1006: 1002: 997: 993: 986: 983: 980: 974: 968: 957: 956: 955: 954: 953: 952: 951: 950: 927: 921: 918: 915: 906: 903: 900: 897: 891: 888: 885: 879: 873: 870: 867: 864: 858: 855: 852: 842: 825: 822: 819: 813: 810: 807: 804: 801: 795: 789: 779: 762: 759: 756: 753: 747: 737: 736: 735: 734: 733: 732: 731: 730: 729: 728: 703: 697: 694: 674: 666: 665: 664: 663: 662: 661: 660: 659: 652: 648: 644: 640: 635: 634: 633: 632: 631: 630: 625: 621: 617: 601: 592: 591: 590: 589: 586: 583: 579: 575: 574: 573: 572: 569: 565: 561: 534: 531: 528: 522: 519: 516: 510: 507: 504: 501: 495: 492: 489: 483: 471: 468: 465: 459: 453: 450: 447: 444: 433: 423: 419: 416: 415: 413: 412: 411: 410: 407: 403: 399: 380: 374: 371: 363: 359: 342: 334: 330: 326: 322: 321: 320: 318: 312: 308: 302: 295: 291: 290: 289: 288: 284: 279: 278: 277: 275: 253: 250: 241: 235: 232: 226: 220: 217: 214: 208: 202: 199: 196: 187: 176: 168: 153: 149: 143: 140: 139: 136: 119: 115: 111: 110: 102: 96: 91: 89: 86: 82: 81: 77: 71: 68: 65: 61: 56: 52: 46: 38: 37: 27: 23: 18: 17: 3318: 3295:β€” Preceding 3292: 3181: 3178: 3161: 3138:β€”Β Preceding 2999: 2996: 2939: 2883: 2879: 2854:Peano axioms 2758:independent. 2755: 2507: 2232: 1884: 1882: 1662: 1658: 1654: 1557:, so either 639:trichotomous 559: 431: 429: 417: 361: 357: 317:Kidburla2002 313: 309: 306: 172: 148:Low-priority 147: 107: 73:Low‑priority 51:WikiProjects 34: 3301:96.29.111.3 3144:96.29.111.3 2968:arithmetic. 1380:. For any 1207:; that is, 1028:, and that 558:. That is, 123:Mathematics 114:mathematics 70:Mathematics 3357:Categories 2663:) implies 2233:What does 3340:JRSpriggs 3166:JRSpriggs 2945:JRSpriggs 2862:JRSpriggs 2291:symbol? - 2216:JRSpriggs 1699:JRSpriggs 1667:JRSpriggs 643:JRSpriggs 582:JRSpriggs 568:JRSpriggs 398:MarkSweep 39:is rated 3322:PicoMath 3297:unsigned 3152:contribs 3140:unsigned 2489:CMummert 294:Alterego 274:Alterego 3315:β€œI βŠƒ ℕ” 2880:refuted 1860:Jayferd 1625:Jayferd 1458:, then 1283:and if 616:Jayferd 150:on the 41:C-class 2358:means 1491:. If 283:MarSch 47:scale. 2508:(See 2293:lethe 28:This 3344:talk 3326:talk 3305:talk 3170:talk 3148:talk 2982:talk 2949:talk 2940:does 2922:talk 2866:talk 2517:talk 2494:talk 2220:talk 1864:talk 1703:talk 1671:talk 1629:talk 647:talk 620:talk 2978:CBM 2756:not 2526:As 1751:to 1590:or 1432:or 142:Low 3359:: 3346:) 3328:) 3307:) 3270:∈ 3258:βˆͺ 3246:∈ 3240:βˆ€ 3237:∧ 3231:∈ 3228:βˆ… 3206:∈ 3197:β‹‚ 3194::= 3172:) 3154:) 3150:β€’ 3100:βˆͺ 3088:∈ 3082:βˆƒ 3076:∈ 3070:βˆ€ 3067:∧ 3061:∈ 3058:βˆ… 3052:∨ 3043:βˆ… 3021:∈ 3012::= 2980:Β· 2951:) 2924:) 2868:) 2781:βˆ’ 2716:Β¬ 2713:⊒ 2683:βˆ’ 2645:βŠ₯ 2642:⊒ 2585:βˆ’ 2551:βŠ₯ 2548:⊒ 2519:) 2491:Β· 2454:∈ 2448:βˆ€ 2445:⇔ 2439:βŠ₯ 2430:∈ 2424:βˆ€ 2421:⇔ 2418:βˆ… 2392:βŠ₯ 2372:βˆ… 2343:βŠ₯ 2334:∈ 2328:βˆ€ 2308:βŠ₯ 2279:βŠ₯ 2256:βŠ₯ 2247:∈ 2241:βˆ€ 2222:) 2194:∈ 2188:∨ 2176:∨ 2170:∈ 2161:Ο‰ 2158:∈ 2152:βˆ€ 2117:∈ 2098:∈ 2092:βˆ€ 2067:βˆ‰ 2036:∈ 2024:∈ 2018:βˆ€ 2012:∈ 2006:βˆ€ 1981:Ο‰ 1978:∈ 1966:∈ 1960:βˆ€ 1916:Ο‰ 1913:∈ 1907:βˆƒ 1904:∨ 1866:) 1837:∈ 1831:β†’ 1819:Ξ¦ 1810:βˆ€ 1807:↔ 1804:Ο‰ 1801:∈ 1789:βˆ€ 1786:Ο‰ 1780:βˆƒ 1705:) 1673:) 1665:? 1631:) 1575:∈ 1535:∈ 1502:∈ 1469:∈ 1417:∈ 1394:Ο‰ 1391:∈ 1365:∈ 1332:∈ 1306:∈ 1300:∨ 1239:∈ 1233:∨ 1215:βˆ€ 1192:∈ 1160:∈ 1154:∨ 1142:∨ 1136:∈ 1124:Ο‰ 1121:∈ 1115:βˆ€ 1106:Ο‰ 1103:∈ 1048:βˆ‰ 1036:βˆ€ 1003:∈ 990:↔ 984:∈ 972:βˆ€ 966:βˆ€ 922:Ο‰ 913:β†’ 904:∈ 895:β†’ 889:∈ 877:βˆ€ 874:∧ 868:∈ 859:Ο‰ 856:βŠ† 850:βˆ€ 817:β†’ 793:βˆ€ 787:βˆ€ 760:β‰  745:βˆ€ 698:βˆͺ 675:Ο‰ 649:) 641:. 622:) 602:Ο‰ 580:. 566:. 538:β€² 520:∈ 514:βˆƒ 511:∨ 493:∈ 487:βˆ€ 484:∧ 475:β€² 457:βˆƒ 454:∨ 375:βˆͺ 343:∈ 272:-- 251:∈ 227:βˆͺ 224:β†’ 218:∈ 206:βˆ€ 203:∧ 197:∈ 194:βˆ… 185:βˆƒ 177:? 3342:( 3324:( 3303:( 3279:} 3276:) 3273:Z 3267:} 3264:x 3261:{ 3255:x 3252:( 3249:Z 3243:x 3234:Z 3225:: 3222:) 3219:I 3216:( 3211:P 3203:Z 3200:{ 3190:N 3168:( 3162:T 3146:( 3124:} 3121:) 3118:] 3115:x 3112:= 3109:} 3106:y 3103:{ 3097:y 3094:[ 3091:T 3085:y 3079:T 3073:x 3064:T 3055:( 3049:T 3046:= 3040:: 3037:) 3034:I 3031:( 3026:P 3018:T 3015:{ 3008:N 2984:) 2976:( 2947:( 2920:( 2864:( 2840:. 2835:y 2832:t 2829:i 2826:n 2823:i 2820:f 2817:n 2814:I 2811:⊬ 2808:) 2805:y 2802:t 2799:i 2796:n 2793:i 2790:f 2787:n 2784:I 2778:C 2775:F 2772:Z 2769:( 2740:y 2737:t 2734:i 2731:n 2728:i 2725:f 2722:n 2719:I 2710:) 2707:y 2704:t 2701:i 2698:n 2695:i 2692:f 2689:n 2686:I 2680:C 2677:F 2674:Z 2671:( 2639:y 2636:t 2633:i 2630:n 2627:i 2624:f 2621:n 2618:I 2615:+ 2612:) 2609:y 2606:t 2603:i 2600:n 2597:i 2594:f 2591:n 2588:I 2582:C 2579:F 2576:Z 2573:( 2545:C 2542:F 2539:Z 2515:( 2484:. 2472:) 2469:k 2466:β‰  2463:k 2460:( 2457:n 2451:k 2442:) 2436:( 2433:n 2427:k 2415:= 2412:n 2369:= 2366:n 2346:) 2340:( 2337:n 2331:k 2259:) 2253:( 2250:n 2244:k 2218:( 2203:. 2200:) 2197:m 2191:n 2185:n 2182:= 2179:m 2173:n 2167:m 2164:( 2155:m 2133:, 2130:) 2125:+ 2121:n 2112:+ 2108:m 2104:( 2101:n 2095:m 2073:, 2070:n 2064:n 2045:, 2042:) 2039:n 2033:k 2030:( 2027:m 2021:k 2015:n 2009:m 1987:, 1984:) 1975:m 1972:( 1969:n 1963:m 1941:, 1938:) 1933:+ 1929:m 1925:= 1922:n 1919:( 1910:m 1901:0 1898:= 1895:n 1885:n 1862:( 1846:) 1843:) 1840:I 1834:x 1828:) 1825:I 1822:( 1816:( 1813:I 1798:x 1795:( 1792:x 1783:! 1759:x 1739:k 1701:( 1669:( 1663:T 1661:∈ 1659:x 1655:x 1627:( 1611:m 1608:= 1603:+ 1599:x 1578:m 1570:+ 1566:x 1543:+ 1539:m 1530:+ 1526:x 1505:m 1499:x 1477:+ 1473:x 1466:m 1446:x 1443:= 1440:m 1420:x 1414:m 1388:m 1368:T 1362:x 1340:+ 1336:x 1329:0 1309:x 1303:0 1297:0 1294:= 1291:x 1271:0 1268:= 1265:0 1245:) 1242:x 1236:0 1230:0 1227:= 1224:x 1221:( 1218:x 1195:T 1189:0 1169:} 1166:) 1163:m 1157:n 1151:n 1148:= 1145:m 1139:n 1133:m 1130:( 1127:) 1118:m 1112:( 1109:: 1100:n 1097:{ 1094:= 1091:T 1054:) 1051:n 1045:n 1042:( 1039:n 1016:) 1011:+ 1007:n 998:+ 994:m 987:n 981:m 978:( 975:n 969:m 928:. 925:) 919:= 916:A 910:) 907:A 901:x 898:S 892:A 886:x 883:( 880:x 871:A 865:0 862:( 853:A 829:) 826:y 823:= 820:x 814:y 811:S 808:= 805:x 802:S 799:( 796:y 790:x 766:) 763:0 757:x 754:S 751:( 748:x 707:} 704:x 701:{ 695:x 645:( 618:( 560:n 544:] 541:) 535:y 532:= 529:x 526:( 523:n 517:y 508:0 505:= 502:x 499:[ 496:n 490:x 481:] 478:) 472:y 469:= 466:n 463:( 460:y 451:0 448:= 445:n 442:[ 432:n 384:} 381:x 378:{ 372:x 362:x 358:x 260:] 257:) 254:x 248:} 245:} 242:y 239:{ 236:, 233:y 230:{ 221:x 215:y 212:( 209:y 200:x 191:[ 188:x 154:. 53::

Index


level-5 vital article
content assessment
WikiProjects
WikiProject icon
Mathematics
WikiProject icon
icon
Mathematics portal
WikiProject Mathematics
mathematics
the discussion
Low
project's priority scale
second-order logic
Alterego
MarSch
Alterego
Kidburla2002
intuitive set theory
axiomatic set theory
Zermelo-Fraenkel set theory
MarkSweep
(call me collect)
08:04, 29 April 2006 (UTC)
axiom of regularity
JRSpriggs
06:34, 26 June 2006 (UTC)
Talk:Natural number#Set theoretic definition
JRSpriggs

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑