Knowledge

Axiom of dependent choice

Source đź“ť

3491: 2629: 1560: 1867: 1451: 2877: 2005: 2447: 1228: 2145: 2710: 573: 3026: 2217: 2180: 362: 1666: 1024: 992: 2382: 466: 2819: 2773: 1610: 435: 3042:
It is possible to generalize the axiom to produce transfinite sequences. If these are allowed to be arbitrarily long, then it becomes equivalent to the full axiom of choice.
1914: 1275: 3165: 2970: 2943: 2916: 2304: 1793: 1637: 942: 911: 849: 822: 789: 755: 724: 681: 654: 83: 52: 1310: 3138: 1481: 2049: 2658: 2473: 2506: 2257: 2077: 1726: 1370: 873: 186: 2536: 242: 212: 2331: 1943: 1170: 1127: 311: 2730: 2277: 2237: 2097: 1766: 1746: 1706: 1686: 1390: 1350: 1330: 1147: 1104: 1084: 1064: 1044: 620: 600: 530: 507: 382: 288: 268: 153: 133: 3955: 2541: 3058:"The foundation of analysis does not require the full generality of set theory but can be accomplished within a more restricted frame." 691:
length, if it is necessary to make a choice at each step and if some of those choices cannot be made independently of previous choices.
1485: 792: 1798: 509:, together with the total relation on this set of the second sequence being obtained from the first by appending a single term.) 1395: 2824: 1952: 2387: 3383: 1175: 3644: 3457: 2102: 2663: 3972: 3410: 3258: 3182: 539: 2991: 2184: 3950: 3544: 2150: 876: 727: 319: 3830: 3276: 3724: 3603: 1643: 3967: 1001: 964: 3960: 3598: 3561: 2336: 440: 2778: 3615: 2735: 1565: 390: 3649: 3534: 3517: 3250: 3243: 3069: 3036: 1872: 1233: 3143: 2948: 2921: 2894: 2282: 1771: 1615: 920: 889: 827: 800: 767: 733: 702: 659: 632: 61: 30: 4105: 3450: 3210:
Blair, Charles E. (1977). "The Baire category theorem implies the principle of dependent choices".
1280: 3123: 4069: 3987: 3862: 3814: 3628: 3551: 3274:
Wolk, Elliot S. (1983), "On the principle of dependent choices and some forms of Zorn's lemma",
1456: 4021: 3902: 3714: 3527: 3310: 3061: 2010: 758: 482:. (To see this, apply the axiom as stated above to the set of finite sequences that start with 2634: 2452: 3937: 3907: 3851: 3771: 3751: 3729: 2478: 2242: 2054: 1711: 1355: 858: 684: 162: 3366:
For a proof that the Axiom of Countable Choice does not imply the Axiom of Dependent Choice
2511: 217: 191: 4011: 4001: 3835: 3766: 3719: 3659: 3539: 3345: 3098: 2981: 2309: 113: 3428: 1919: 8: 4006: 3917: 3825: 3820: 3634: 3576: 3507: 3443: 3029: 1946: 952: 94: 3303:
Bernays proved that the axiom of dependent choice implies the axiom of countable choice
1152: 1109: 293: 3929: 3924: 3709: 3664: 3571: 3349: 3333: 3102: 3086: 2715: 2262: 2222: 2082: 1751: 1731: 1691: 1671: 1375: 1335: 1315: 1132: 1089: 1069: 1049: 1029: 623: 622:
terms of such a sequence. The axiom of dependent choice says that we can form a whole (
605: 585: 515: 492: 367: 273: 253: 138: 118: 3786: 3623: 3586: 3556: 3480: 3416: 3406: 3379: 3353: 3254: 3178: 3106: 2977: 248: 4074: 4064: 4049: 4044: 3912: 3566: 3424: 3325: 3285: 3229: 3078: 3943: 3881: 3699: 3512: 3402: 3341: 3238: 3094: 914: 55: 4079: 3876: 3857: 3761: 3746: 3703: 3639: 3581: 156: 4099: 4084: 3886: 3800: 3795: 3420: 3234: 2985: 2973: 945: 688: 98: 86: 4054: 247:
The axiom of dependent choice can be stated as follows: For every nonempty
4034: 4029: 3847: 3776: 3734: 3593: 3490: 3290: 949: 90: 4059: 3694: 3371: 3208:"The Baire category theorem implies the principle of dependent choices." 852: 533: 20: 2976:
set of real numbers, or that there is a set of real numbers without the
2624:{\displaystyle t_{n}=\langle x_{0},\dots ,x_{m},\dots ,x_{m+n}\rangle .} 4039: 3810: 3466: 3337: 3090: 3842: 3805: 3756: 3654: 3329: 3082: 683:
that is required to show the existence of a sequence constructed by
314: 3175:
Zermelo's Axiom of Choice: Its origins, development, and influence
1555:{\displaystyle \langle x_{0},\dots ,x_{n},x_{n+1}\rangle \in T,} 602:, one can use ordinary mathematical induction to form the first 3867: 3689: 3739: 3499: 3435: 101: 3032:, has the Baire property and has the perfect set property. 1862:{\displaystyle t_{n}=\langle x_{0},\dots ,x_{f(n)}\rangle } 1149:
is an infinite sequence whose neighboring elements satisfy
1446:{\displaystyle \langle x_{0},\dots ,x_{n},\dots \rangle .} 2872:{\displaystyle \langle x_{0},\dots ,x_{k},\dots \rangle } 2000:{\displaystyle \langle x_{0},\dots ,x_{k},\dots \rangle } 2442:{\displaystyle t_{0}=\langle x_{0},\dots ,x_{m}\rangle } 1223:{\displaystyle \langle x_{0},\dots ,x_{n}\rangle \in T} 1106:
of finite sequences whose neighboring elements satisfy
3111:
The axiom of dependent choice is stated on p. 86.
2007:
is a branch. (This proof only needs to prove this for
3311:"Part III. Infinity and enumerability. Analysis" 3249:(3rd ed.). Cambridge University Press. pp.  3146: 3126: 3062:"Part III. Infinity and enumerability. Analysis" 2994: 2951: 2924: 2897: 2827: 2781: 2738: 2718: 2666: 2637: 2544: 2514: 2481: 2455: 2390: 2339: 2312: 2285: 2265: 2245: 2225: 2187: 2153: 2105: 2085: 2057: 2013: 1955: 1922: 1875: 1801: 1774: 1754: 1734: 1714: 1694: 1674: 1646: 1618: 1568: 1488: 1459: 1398: 1378: 1358: 1338: 1318: 1283: 1236: 1178: 1155: 1135: 1112: 1092: 1072: 1052: 1032: 1004: 967: 923: 892: 861: 830: 803: 770: 736: 705: 662: 635: 608: 588: 542: 518: 495: 443: 393: 370: 322: 296: 276: 256: 220: 194: 165: 141: 121: 64: 33: 3212:
Bull. Acad. Polon. Sci. SĂ©r. Sci. Math. Astron. Phys
2140:{\displaystyle v,\operatorname {length} (u)>0,\,} 1728:
levels. The strategy is to define a binary relation
955:
is finite and bounded, must have a maximal element.
3242: 3159: 3132: 3120:Moore states that "Principle of Dependent Choices 3020: 2964: 2937: 2910: 2871: 2813: 2767: 2724: 2705:{\displaystyle \langle x_{0},\dots ,x_{k}\rangle } 2704: 2652: 2623: 2530: 2500: 2467: 2441: 2376: 2325: 2298: 2271: 2251: 2231: 2211: 2174: 2139: 2091: 2071: 2043: 1999: 1937: 1908: 1861: 1787: 1760: 1740: 1720: 1700: 1680: 1660: 1631: 1604: 1554: 1475: 1445: 1384: 1364: 1344: 1324: 1304: 1269: 1222: 1164: 1141: 1121: 1098: 1078: 1058: 1038: 1018: 986: 936: 905: 867: 843: 816: 783: 749: 718: 675: 648: 614: 594: 567: 524: 501: 460: 429: 376: 356: 305: 282: 262: 236: 206: 180: 147: 127: 77: 46: 3209: 3028:, and every set of real numbers in this model is 1469: 4097: 568:{\displaystyle {\mathsf {DC}}_{\mathbb {R} }.} 489:and in which subsequent terms are in relation 85:) that is still sufficient to develop much of 3451: 3233: 3021:{\displaystyle {\mathsf {ZF}}+{\mathsf {DC}}} 2886: 2212:{\displaystyle \operatorname {length} (u)+1.} 994:Every pruned tree with ω levels has a branch 2866: 2828: 2699: 2667: 2615: 2558: 2436: 2404: 1994: 1956: 1856: 1815: 1540: 1489: 1437: 1399: 1211: 1179: 2306:implies that there is an infinite sequence 2175:{\displaystyle \operatorname {length} (v)=} 357:{\displaystyle (x_{n})_{n\in \mathbb {N} }} 3458: 3444: 3035:The axiom of dependent choice implies the 983: 979: 478:may be taken to be any desired element of 3289: 2792: 2749: 2354: 2350: 2136: 2065: 2061: 1889: 1654: 1650: 1582: 1250: 1012: 1008: 968: 556: 536:, then the resulting axiom is denoted by 532:above is restricted to be the set of all 451: 404: 348: 224: 3267: 2732:because it is an initial subsequence of 944:is equivalent to the statement that any 694: 3308: 3059: 4098: 3167:implies the Löwenheim–Skolem theorem. 3152: 3149: 3013: 3010: 3000: 2997: 2957: 2954: 2930: 2927: 2903: 2900: 2291: 2288: 1780: 1777: 1661:{\displaystyle (\,\Longrightarrow \,)} 1624: 1621: 974: 971: 929: 926: 898: 895: 836: 833: 809: 806: 776: 773: 742: 739: 711: 708: 668: 665: 641: 638: 549: 546: 70: 67: 39: 36: 3439: 3172: 3140:Löwenheim–Skolem theorem" — that is, 1949:function. Then the infinite sequence 1019:{\displaystyle (\,\Longleftarrow \,)} 987:{\displaystyle \,{\mathsf {DC}}\iff } 3396: 3370: 3320:. A system of axiomatic set theory. 3273: 3073:. A system of axiomatic set theory. 913:is equivalent to a weakened form of 582:Even without such an axiom, for any 3378:, North Holland, pp. 130–131, 1066:. The strategy is to define a tree 107: 13: 2377:{\displaystyle t_{n}\,R\,t_{n+1}.} 461:{\displaystyle n\in \mathbb {N} .} 14: 4117: 2814:{\displaystyle t_{n}\,(k\geq m).} 793:downward Löwenheim–Skolem theorem 3489: 2945:is insufficient to prove (given 2768:{\displaystyle t_{0}\,(k\leq m)} 1605:{\displaystyle x_{n}R\,x_{n+1}.} 1046:be an entire binary relation on 430:{\displaystyle x_{n}\,R~x_{n+1}} 104:are needed to develop analysis. 16:Weak form of the axiom of choice 1909:{\displaystyle t_{n}R\,t_{n+1}} 1270:{\displaystyle x_{k}R\,x_{k+1}} 3465: 3360: 3297: 3277:Canadian Mathematical Bulletin 3222: 3202: 3160:{\displaystyle {\mathsf {DC}}} 3127: 3114: 3052: 2965:{\displaystyle {\mathsf {ZF}}} 2938:{\displaystyle {\mathsf {DC}}} 2911:{\displaystyle {\mathsf {AC}}} 2805: 2793: 2762: 2750: 2299:{\displaystyle {\mathsf {DC}}} 2200: 2194: 2166: 2160: 2124: 2118: 2023: 2017: 1932: 1926: 1851: 1845: 1788:{\displaystyle {\mathsf {DC}}} 1655: 1651: 1647: 1632:{\displaystyle {\mathsf {DC}}} 1013: 1009: 1005: 980: 937:{\displaystyle {\mathsf {DC}}} 906:{\displaystyle {\mathsf {DC}}} 844:{\displaystyle {\mathsf {ZF}}} 817:{\displaystyle {\mathsf {DC}}} 784:{\displaystyle {\mathsf {ZF}}} 750:{\displaystyle {\mathsf {DC}}} 730:without the axiom of choice), 719:{\displaystyle {\mathsf {ZF}}} 676:{\displaystyle {\mathsf {AC}}} 649:{\displaystyle {\mathsf {DC}}} 337: 323: 78:{\displaystyle {\mathsf {AC}}} 47:{\displaystyle {\mathsf {DC}}} 1: 3401:(Third Millennium ed.). 3195: 2099:is an initial subsequence of 1305:{\displaystyle 0\leq k<n.} 3133:{\displaystyle \Rightarrow } 851:to the statement that every 761:for complete metric spaces. 7: 2984:. This follows because the 764:It is also equivalent over 728:Zermelo–Fraenkel set theory 10: 4122: 3956:von Neumann–Bernays–Gödel 3173:Moore, Gregory H. (1982). 3039:and is strictly stronger. 2887:Relation with other axioms 1476:{\displaystyle n\geq 0\!:} 270:and every total relation 4020: 3983: 3895: 3785: 3757:One-to-one correspondence 3673: 3614: 3498: 3487: 3473: 3318:Journal of Symbolic Logic 3177:. Springer. p. 325. 3070:Journal of Symbolic Logic 3037:axiom of countable choice 2044:{\displaystyle f(n)=m+n.} 25:axiom of dependent choice 3045: 2653:{\displaystyle k\geq 0,} 2468:{\displaystyle m\geq 0.} 824:is also equivalent over 54:, is a weak form of the 3245:Computability and Logic 2508:be the last element of 2501:{\displaystyle x_{m+n}} 2252:{\displaystyle \omega } 2072:{\displaystyle u\,R\,v} 1721:{\displaystyle \omega } 1365:{\displaystyle \omega } 868:{\displaystyle \omega } 181:{\displaystyle a\in X,} 89:. It was introduced by 3715:Constructible universe 3535:Constructibility (V=L) 3309:Bernays, Paul (1942). 3291:10.4153/CMB-1983-062-5 3161: 3134: 3060:Bernays, Paul (1942). 3022: 2966: 2939: 2912: 2873: 2815: 2769: 2726: 2706: 2654: 2625: 2532: 2531:{\displaystyle t_{n}.} 2502: 2469: 2443: 2378: 2327: 2300: 2279:is entire. Therefore, 2273: 2253: 2239:is a pruned tree with 2233: 2213: 2176: 2141: 2093: 2073: 2045: 2001: 1939: 1910: 1863: 1789: 1762: 1742: 1722: 1702: 1682: 1662: 1633: 1606: 1556: 1477: 1447: 1386: 1366: 1352:is a pruned tree with 1346: 1326: 1306: 1271: 1224: 1166: 1143: 1129:Then a branch through 1123: 1100: 1080: 1060: 1040: 1020: 988: 938: 907: 869: 845: 818: 785: 759:Baire category theorem 751: 720: 677: 650: 616: 596: 577: 569: 526: 503: 462: 431: 378: 358: 307: 284: 264: 238: 237:{\displaystyle a\,R~b} 208: 207:{\displaystyle b\in X} 182: 149: 129: 79: 48: 3938:Principia Mathematica 3772:Transfinite induction 3631:(i.e. set difference) 3397:Jech, Thomas (2003). 3162: 3135: 3023: 2967: 2940: 2913: 2874: 2816: 2770: 2727: 2707: 2655: 2626: 2533: 2503: 2470: 2444: 2379: 2328: 2326:{\displaystyle t_{n}} 2301: 2274: 2254: 2234: 2214: 2177: 2142: 2094: 2074: 2046: 2002: 1940: 1911: 1864: 1790: 1763: 1743: 1723: 1703: 1683: 1663: 1634: 1607: 1557: 1478: 1448: 1387: 1367: 1347: 1327: 1307: 1272: 1225: 1167: 1144: 1124: 1101: 1081: 1061: 1041: 1021: 989: 939: 908: 870: 846: 819: 786: 757:is equivalent to the 752: 721: 695:Equivalent statements 685:transfinite recursion 678: 651: 626:) sequence this way. 617: 597: 570: 527: 504: 463: 432: 379: 359: 308: 285: 265: 239: 209: 183: 150: 130: 93:in a 1942 article in 80: 49: 4012:Burali-Forti paradox 3767:Set-builder notation 3720:Continuum hypothesis 3660:Symmetric difference 3144: 3124: 2992: 2982:perfect set property 2949: 2922: 2895: 2825: 2779: 2736: 2716: 2664: 2635: 2542: 2512: 2479: 2453: 2388: 2337: 2310: 2283: 2263: 2243: 2223: 2185: 2151: 2103: 2083: 2055: 2051:) Start by defining 2011: 1953: 1938:{\displaystyle f(n)} 1920: 1873: 1799: 1795:produces a sequence 1772: 1752: 1732: 1712: 1692: 1688:be a pruned tree on 1672: 1644: 1616: 1566: 1486: 1457: 1396: 1376: 1356: 1336: 1316: 1281: 1234: 1176: 1153: 1133: 1110: 1090: 1070: 1050: 1030: 1002: 965: 921: 890: 859: 828: 801: 768: 734: 703: 660: 633: 606: 586: 540: 516: 493: 441: 391: 368: 320: 294: 274: 254: 218: 192: 163: 139: 119: 114:homogeneous relation 97:that explores which 62: 31: 3973:Tarski–Grothendieck 3376:The Axiom of Choice 3239:Jeffrey, Richard C. 3030:Lebesgue measurable 1947:strictly increasing 656:is the fragment of 95:reverse mathematics 3562:Limitation of size 3157: 3130: 3018: 2972:) that there is a 2962: 2935: 2908: 2869: 2811: 2765: 2722: 2702: 2650: 2621: 2528: 2498: 2465: 2439: 2374: 2323: 2296: 2269: 2249: 2229: 2209: 2172: 2137: 2089: 2069: 2041: 1997: 1935: 1906: 1859: 1785: 1758: 1738: 1718: 1698: 1678: 1658: 1629: 1602: 1552: 1473: 1443: 1382: 1362: 1342: 1322: 1302: 1267: 1220: 1172:Start by defining 1165:{\displaystyle R.} 1162: 1139: 1122:{\displaystyle R.} 1119: 1096: 1076: 1056: 1036: 1016: 984: 934: 903: 865: 841: 814: 781: 747: 716: 673: 646: 624:countably infinite 612: 592: 565: 522: 499: 458: 427: 374: 354: 306:{\displaystyle X,} 303: 280: 260: 234: 204: 188:there exists some 178: 145: 125: 75: 44: 4093: 4092: 4002:Russell's paradox 3951:Zermelo–Fraenkel 3852:Dedekind-infinite 3725:Diagonal argument 3624:Cartesian product 3481:Set (mathematics) 3385:978-0-486-46624-8 3235:Boolos, George S. 2978:property of Baire 2884: 2883: 2725:{\displaystyle T} 2272:{\displaystyle R} 2232:{\displaystyle T} 2092:{\displaystyle u} 1761:{\displaystyle T} 1741:{\displaystyle R} 1701:{\displaystyle X} 1681:{\displaystyle T} 1385:{\displaystyle T} 1345:{\displaystyle T} 1325:{\displaystyle R} 1142:{\displaystyle T} 1099:{\displaystyle X} 1079:{\displaystyle T} 1059:{\displaystyle X} 1039:{\displaystyle R} 615:{\displaystyle n} 595:{\displaystyle n} 525:{\displaystyle X} 502:{\displaystyle R} 410: 377:{\displaystyle X} 283:{\displaystyle R} 263:{\displaystyle X} 230: 148:{\displaystyle X} 128:{\displaystyle R} 4113: 4075:Bertrand Russell 4065:John von Neumann 4050:Abraham Fraenkel 4045:Richard Dedekind 4007:Suslin's problem 3918:Cantor's theorem 3635:De Morgan's laws 3493: 3460: 3453: 3446: 3437: 3436: 3432: 3389: 3388: 3364: 3358: 3357: 3315: 3301: 3295: 3294: 3293: 3271: 3265: 3264: 3248: 3226: 3220: 3219: 3206: 3189: 3188: 3166: 3164: 3163: 3158: 3156: 3155: 3139: 3137: 3136: 3131: 3118: 3112: 3110: 3066: 3056: 3027: 3025: 3024: 3019: 3017: 3016: 3004: 3003: 2971: 2969: 2968: 2963: 2961: 2960: 2944: 2942: 2941: 2936: 2934: 2933: 2917: 2915: 2914: 2909: 2907: 2906: 2878: 2876: 2875: 2870: 2859: 2858: 2840: 2839: 2820: 2818: 2817: 2812: 2791: 2790: 2774: 2772: 2771: 2766: 2748: 2747: 2731: 2729: 2728: 2723: 2711: 2709: 2708: 2703: 2698: 2697: 2679: 2678: 2659: 2657: 2656: 2651: 2630: 2628: 2627: 2622: 2614: 2613: 2589: 2588: 2570: 2569: 2554: 2553: 2537: 2535: 2534: 2529: 2524: 2523: 2507: 2505: 2504: 2499: 2497: 2496: 2474: 2472: 2471: 2466: 2448: 2446: 2445: 2440: 2435: 2434: 2416: 2415: 2400: 2399: 2383: 2381: 2380: 2375: 2370: 2369: 2349: 2348: 2332: 2330: 2329: 2324: 2322: 2321: 2305: 2303: 2302: 2297: 2295: 2294: 2278: 2276: 2275: 2270: 2258: 2256: 2255: 2250: 2238: 2236: 2235: 2230: 2218: 2216: 2215: 2210: 2181: 2179: 2178: 2173: 2146: 2144: 2143: 2138: 2098: 2096: 2095: 2090: 2078: 2076: 2075: 2070: 2050: 2048: 2047: 2042: 2006: 2004: 2003: 1998: 1987: 1986: 1968: 1967: 1944: 1942: 1941: 1936: 1915: 1913: 1912: 1907: 1905: 1904: 1885: 1884: 1868: 1866: 1865: 1860: 1855: 1854: 1827: 1826: 1811: 1810: 1794: 1792: 1791: 1786: 1784: 1783: 1767: 1765: 1764: 1759: 1747: 1745: 1744: 1739: 1727: 1725: 1724: 1719: 1707: 1705: 1704: 1699: 1687: 1685: 1684: 1679: 1667: 1665: 1664: 1659: 1638: 1636: 1635: 1630: 1628: 1627: 1611: 1609: 1608: 1603: 1598: 1597: 1578: 1577: 1561: 1559: 1558: 1553: 1539: 1538: 1520: 1519: 1501: 1500: 1482: 1480: 1479: 1474: 1452: 1450: 1449: 1444: 1430: 1429: 1411: 1410: 1391: 1389: 1388: 1383: 1371: 1369: 1368: 1363: 1351: 1349: 1348: 1343: 1331: 1329: 1328: 1323: 1311: 1309: 1308: 1303: 1276: 1274: 1273: 1268: 1266: 1265: 1246: 1245: 1229: 1227: 1226: 1221: 1210: 1209: 1191: 1190: 1171: 1169: 1168: 1163: 1148: 1146: 1145: 1140: 1128: 1126: 1125: 1120: 1105: 1103: 1102: 1097: 1085: 1083: 1082: 1077: 1065: 1063: 1062: 1057: 1045: 1043: 1042: 1037: 1025: 1023: 1022: 1017: 993: 991: 990: 985: 978: 977: 958: 957: 948:such that every 943: 941: 940: 935: 933: 932: 912: 910: 909: 904: 902: 901: 874: 872: 871: 866: 850: 848: 847: 842: 840: 839: 823: 821: 820: 815: 813: 812: 790: 788: 787: 782: 780: 779: 756: 754: 753: 748: 746: 745: 725: 723: 722: 717: 715: 714: 682: 680: 679: 674: 672: 671: 655: 653: 652: 647: 645: 644: 621: 619: 618: 613: 601: 599: 598: 593: 574: 572: 571: 566: 561: 560: 559: 553: 552: 531: 529: 528: 523: 508: 506: 505: 500: 467: 465: 464: 459: 454: 436: 434: 433: 428: 426: 425: 408: 403: 402: 383: 381: 380: 375: 363: 361: 360: 355: 353: 352: 351: 335: 334: 312: 310: 309: 304: 289: 287: 286: 281: 269: 267: 266: 261: 243: 241: 240: 235: 228: 213: 211: 210: 205: 187: 185: 184: 179: 154: 152: 151: 146: 134: 132: 131: 126: 108:Formal statement 84: 82: 81: 76: 74: 73: 53: 51: 50: 45: 43: 42: 4121: 4120: 4116: 4115: 4114: 4112: 4111: 4110: 4106:Axiom of choice 4096: 4095: 4094: 4089: 4016: 3995: 3979: 3944:New Foundations 3891: 3781: 3700:Cardinal number 3683: 3669: 3610: 3494: 3485: 3469: 3464: 3413: 3403:Springer-Verlag 3393: 3392: 3386: 3365: 3361: 3330:10.2307/2266303 3313: 3302: 3298: 3272: 3268: 3261: 3227: 3223: 3207: 3203: 3198: 3193: 3192: 3185: 3148: 3147: 3145: 3142: 3141: 3125: 3122: 3121: 3119: 3115: 3083:10.2307/2266303 3064: 3057: 3053: 3048: 3009: 3008: 2996: 2995: 2993: 2990: 2989: 2980:or without the 2953: 2952: 2950: 2947: 2946: 2926: 2925: 2923: 2920: 2919: 2899: 2898: 2896: 2893: 2892: 2889: 2854: 2850: 2835: 2831: 2826: 2823: 2822: 2786: 2782: 2780: 2777: 2776: 2743: 2739: 2737: 2734: 2733: 2717: 2714: 2713: 2693: 2689: 2674: 2670: 2665: 2662: 2661: 2636: 2633: 2632: 2603: 2599: 2584: 2580: 2565: 2561: 2549: 2545: 2543: 2540: 2539: 2519: 2515: 2513: 2510: 2509: 2486: 2482: 2480: 2477: 2476: 2454: 2451: 2450: 2430: 2426: 2411: 2407: 2395: 2391: 2389: 2386: 2385: 2359: 2355: 2344: 2340: 2338: 2335: 2334: 2317: 2313: 2311: 2308: 2307: 2287: 2286: 2284: 2281: 2280: 2264: 2261: 2260: 2244: 2241: 2240: 2224: 2221: 2220: 2186: 2183: 2182: 2152: 2149: 2148: 2104: 2101: 2100: 2084: 2081: 2080: 2056: 2053: 2052: 2012: 2009: 2008: 1982: 1978: 1963: 1959: 1954: 1951: 1950: 1921: 1918: 1917: 1894: 1890: 1880: 1876: 1874: 1871: 1870: 1841: 1837: 1822: 1818: 1806: 1802: 1800: 1797: 1796: 1776: 1775: 1773: 1770: 1769: 1753: 1750: 1749: 1733: 1730: 1729: 1713: 1710: 1709: 1693: 1690: 1689: 1673: 1670: 1669: 1645: 1642: 1641: 1620: 1619: 1617: 1614: 1613: 1587: 1583: 1573: 1569: 1567: 1564: 1563: 1528: 1524: 1515: 1511: 1496: 1492: 1487: 1484: 1483: 1458: 1455: 1454: 1425: 1421: 1406: 1402: 1397: 1394: 1393: 1377: 1374: 1373: 1357: 1354: 1353: 1337: 1334: 1333: 1317: 1314: 1313: 1282: 1279: 1278: 1255: 1251: 1241: 1237: 1235: 1232: 1231: 1205: 1201: 1186: 1182: 1177: 1174: 1173: 1154: 1151: 1150: 1134: 1131: 1130: 1111: 1108: 1107: 1091: 1088: 1087: 1071: 1068: 1067: 1051: 1048: 1047: 1031: 1028: 1027: 1003: 1000: 999: 970: 969: 966: 963: 962: 925: 924: 922: 919: 918: 917:; specifically 894: 893: 891: 888: 887: 860: 857: 856: 832: 831: 829: 826: 825: 805: 804: 802: 799: 798: 772: 771: 769: 766: 765: 738: 737: 735: 732: 731: 707: 706: 704: 701: 700: 697: 664: 663: 661: 658: 657: 637: 636: 634: 631: 630: 607: 604: 603: 587: 584: 583: 580: 555: 554: 545: 544: 543: 541: 538: 537: 517: 514: 513: 494: 491: 490: 488: 477: 450: 442: 439: 438: 415: 411: 398: 394: 392: 389: 388: 369: 366: 365: 347: 340: 336: 330: 326: 321: 318: 317: 313:there exists a 295: 292: 291: 275: 272: 271: 255: 252: 251: 219: 216: 215: 193: 190: 189: 164: 161: 160: 140: 137: 136: 120: 117: 116: 110: 66: 65: 63: 60: 59: 56:axiom of choice 35: 34: 32: 29: 28: 17: 12: 11: 5: 4119: 4109: 4108: 4091: 4090: 4088: 4087: 4082: 4080:Thoralf Skolem 4077: 4072: 4067: 4062: 4057: 4052: 4047: 4042: 4037: 4032: 4026: 4024: 4018: 4017: 4015: 4014: 4009: 4004: 3998: 3996: 3994: 3993: 3990: 3984: 3981: 3980: 3978: 3977: 3976: 3975: 3970: 3965: 3964: 3963: 3948: 3947: 3946: 3934: 3933: 3932: 3921: 3920: 3915: 3910: 3905: 3899: 3897: 3893: 3892: 3890: 3889: 3884: 3879: 3874: 3865: 3860: 3855: 3845: 3840: 3839: 3838: 3833: 3828: 3818: 3808: 3803: 3798: 3792: 3790: 3783: 3782: 3780: 3779: 3774: 3769: 3764: 3762:Ordinal number 3759: 3754: 3749: 3744: 3743: 3742: 3737: 3727: 3722: 3717: 3712: 3707: 3697: 3692: 3686: 3684: 3682: 3681: 3678: 3674: 3671: 3670: 3668: 3667: 3662: 3657: 3652: 3647: 3642: 3640:Disjoint union 3637: 3632: 3626: 3620: 3618: 3612: 3611: 3609: 3608: 3607: 3606: 3601: 3590: 3589: 3587:Martin's axiom 3584: 3579: 3574: 3569: 3564: 3559: 3554: 3552:Extensionality 3549: 3548: 3547: 3537: 3532: 3531: 3530: 3525: 3520: 3510: 3504: 3502: 3496: 3495: 3488: 3486: 3484: 3483: 3477: 3475: 3471: 3470: 3463: 3462: 3455: 3448: 3440: 3434: 3433: 3411: 3391: 3390: 3384: 3359: 3307:p. 86 in 3296: 3284:(3): 365–367, 3266: 3259: 3221: 3218:(10): 933–934. 3200: 3199: 3197: 3194: 3191: 3190: 3183: 3154: 3151: 3129: 3113: 3050: 3049: 3047: 3044: 3015: 3012: 3007: 3002: 2999: 2974:non-measurable 2959: 2956: 2932: 2929: 2905: 2902: 2888: 2885: 2882: 2881: 2868: 2865: 2862: 2857: 2853: 2849: 2846: 2843: 2838: 2834: 2830: 2810: 2807: 2804: 2801: 2798: 2795: 2789: 2785: 2764: 2761: 2758: 2755: 2752: 2746: 2742: 2721: 2701: 2696: 2692: 2688: 2685: 2682: 2677: 2673: 2669: 2649: 2646: 2643: 2640: 2620: 2617: 2612: 2609: 2606: 2602: 2598: 2595: 2592: 2587: 2583: 2579: 2576: 2573: 2568: 2564: 2560: 2557: 2552: 2548: 2527: 2522: 2518: 2495: 2492: 2489: 2485: 2464: 2461: 2458: 2438: 2433: 2429: 2425: 2422: 2419: 2414: 2410: 2406: 2403: 2398: 2394: 2373: 2368: 2365: 2362: 2358: 2353: 2347: 2343: 2320: 2316: 2293: 2290: 2268: 2248: 2228: 2208: 2205: 2202: 2199: 2196: 2193: 2190: 2171: 2168: 2165: 2162: 2159: 2156: 2135: 2132: 2129: 2126: 2123: 2120: 2117: 2114: 2111: 2108: 2088: 2068: 2064: 2060: 2040: 2037: 2034: 2031: 2028: 2025: 2022: 2019: 2016: 1996: 1993: 1990: 1985: 1981: 1977: 1974: 1971: 1966: 1962: 1958: 1934: 1931: 1928: 1925: 1903: 1900: 1897: 1893: 1888: 1883: 1879: 1858: 1853: 1850: 1847: 1844: 1840: 1836: 1833: 1830: 1825: 1821: 1817: 1814: 1809: 1805: 1782: 1779: 1757: 1737: 1717: 1697: 1677: 1657: 1653: 1649: 1626: 1623: 1601: 1596: 1593: 1590: 1586: 1581: 1576: 1572: 1562:which implies 1551: 1548: 1545: 1542: 1537: 1534: 1531: 1527: 1523: 1518: 1514: 1510: 1507: 1504: 1499: 1495: 1491: 1472: 1468: 1465: 1462: 1442: 1439: 1436: 1433: 1428: 1424: 1420: 1417: 1414: 1409: 1405: 1401: 1381: 1372:levels. Thus, 1361: 1341: 1321: 1301: 1298: 1295: 1292: 1289: 1286: 1264: 1261: 1258: 1254: 1249: 1244: 1240: 1219: 1216: 1213: 1208: 1204: 1200: 1197: 1194: 1189: 1185: 1181: 1161: 1158: 1138: 1118: 1115: 1095: 1075: 1055: 1035: 1015: 1011: 1007: 996: 995: 982: 976: 973: 931: 928: 900: 897: 864: 838: 835: 811: 808: 778: 775: 744: 741: 713: 710: 696: 693: 670: 667: 643: 640: 611: 591: 579: 576: 564: 558: 551: 548: 521: 498: 486: 475: 469: 468: 457: 453: 449: 446: 424: 421: 418: 414: 407: 401: 397: 373: 350: 346: 343: 339: 333: 329: 325: 302: 299: 279: 259: 233: 227: 223: 203: 200: 197: 177: 174: 171: 168: 157:total relation 144: 124: 109: 106: 72: 69: 41: 38: 15: 9: 6: 4: 3: 2: 4118: 4107: 4104: 4103: 4101: 4086: 4085:Ernst Zermelo 4083: 4081: 4078: 4076: 4073: 4071: 4070:Willard Quine 4068: 4066: 4063: 4061: 4058: 4056: 4053: 4051: 4048: 4046: 4043: 4041: 4038: 4036: 4033: 4031: 4028: 4027: 4025: 4023: 4022:Set theorists 4019: 4013: 4010: 4008: 4005: 4003: 4000: 3999: 3997: 3991: 3989: 3986: 3985: 3982: 3974: 3971: 3969: 3968:Kripke–Platek 3966: 3962: 3959: 3958: 3957: 3954: 3953: 3952: 3949: 3945: 3942: 3941: 3940: 3939: 3935: 3931: 3928: 3927: 3926: 3923: 3922: 3919: 3916: 3914: 3911: 3909: 3906: 3904: 3901: 3900: 3898: 3894: 3888: 3885: 3883: 3880: 3878: 3875: 3873: 3871: 3866: 3864: 3861: 3859: 3856: 3853: 3849: 3846: 3844: 3841: 3837: 3834: 3832: 3829: 3827: 3824: 3823: 3822: 3819: 3816: 3812: 3809: 3807: 3804: 3802: 3799: 3797: 3794: 3793: 3791: 3788: 3784: 3778: 3775: 3773: 3770: 3768: 3765: 3763: 3760: 3758: 3755: 3753: 3750: 3748: 3745: 3741: 3738: 3736: 3733: 3732: 3731: 3728: 3726: 3723: 3721: 3718: 3716: 3713: 3711: 3708: 3705: 3701: 3698: 3696: 3693: 3691: 3688: 3687: 3685: 3679: 3676: 3675: 3672: 3666: 3663: 3661: 3658: 3656: 3653: 3651: 3648: 3646: 3643: 3641: 3638: 3636: 3633: 3630: 3627: 3625: 3622: 3621: 3619: 3617: 3613: 3605: 3604:specification 3602: 3600: 3597: 3596: 3595: 3592: 3591: 3588: 3585: 3583: 3580: 3578: 3575: 3573: 3570: 3568: 3565: 3563: 3560: 3558: 3555: 3553: 3550: 3546: 3543: 3542: 3541: 3538: 3536: 3533: 3529: 3526: 3524: 3521: 3519: 3516: 3515: 3514: 3511: 3509: 3506: 3505: 3503: 3501: 3497: 3492: 3482: 3479: 3478: 3476: 3472: 3468: 3461: 3456: 3454: 3449: 3447: 3442: 3441: 3438: 3430: 3426: 3422: 3418: 3414: 3412:3-540-44085-2 3408: 3404: 3400: 3395: 3394: 3387: 3381: 3377: 3373: 3369: 3363: 3355: 3351: 3347: 3343: 3339: 3335: 3331: 3327: 3323: 3319: 3312: 3306: 3300: 3292: 3287: 3283: 3279: 3278: 3270: 3262: 3260:0-521-38026-X 3256: 3252: 3247: 3246: 3240: 3236: 3232:is proved in 3231: 3225: 3217: 3213: 3205: 3201: 3186: 3184:0-387-90670-3 3180: 3176: 3170: 3117: 3108: 3104: 3100: 3096: 3092: 3088: 3084: 3080: 3076: 3072: 3071: 3063: 3055: 3051: 3043: 3040: 3038: 3033: 3031: 3005: 2987: 2986:Solovay model 2983: 2979: 2975: 2880: 2879:is a branch. 2863: 2860: 2855: 2851: 2847: 2844: 2841: 2836: 2832: 2808: 2802: 2799: 2796: 2787: 2783: 2759: 2756: 2753: 2744: 2740: 2719: 2694: 2690: 2686: 2683: 2680: 2675: 2671: 2660:the sequence 2647: 2644: 2641: 2638: 2618: 2610: 2607: 2604: 2600: 2596: 2593: 2590: 2585: 2581: 2577: 2574: 2571: 2566: 2562: 2555: 2550: 2546: 2525: 2520: 2516: 2493: 2490: 2487: 2483: 2462: 2459: 2456: 2431: 2427: 2423: 2420: 2417: 2412: 2408: 2401: 2396: 2392: 2371: 2366: 2363: 2360: 2356: 2351: 2345: 2341: 2318: 2314: 2266: 2246: 2226: 2206: 2203: 2197: 2191: 2188: 2169: 2163: 2157: 2154: 2133: 2130: 2127: 2121: 2115: 2112: 2109: 2106: 2086: 2066: 2062: 2058: 2038: 2035: 2032: 2029: 2026: 2020: 2014: 1991: 1988: 1983: 1979: 1975: 1972: 1969: 1964: 1960: 1948: 1929: 1923: 1901: 1898: 1895: 1891: 1886: 1881: 1877: 1848: 1842: 1838: 1834: 1831: 1828: 1823: 1819: 1812: 1807: 1803: 1755: 1735: 1715: 1695: 1675: 1599: 1594: 1591: 1588: 1584: 1579: 1574: 1570: 1549: 1546: 1543: 1535: 1532: 1529: 1525: 1521: 1516: 1512: 1508: 1505: 1502: 1497: 1493: 1470: 1466: 1463: 1460: 1440: 1434: 1431: 1426: 1422: 1418: 1415: 1412: 1407: 1403: 1392:has a branch 1379: 1359: 1339: 1319: 1299: 1296: 1293: 1290: 1287: 1284: 1262: 1259: 1256: 1252: 1247: 1242: 1238: 1217: 1214: 1206: 1202: 1198: 1195: 1192: 1187: 1183: 1159: 1156: 1136: 1116: 1113: 1093: 1073: 1053: 1033: 998: 997: 960: 959: 956: 954: 951: 947: 946:partial order 916: 886:Furthermore, 884: 882: 878: 875:levels has a 862: 854: 796: 794: 762: 760: 729: 692: 690: 686: 627: 625: 609: 589: 575: 562: 535: 519: 510: 496: 485: 481: 474: 455: 447: 444: 422: 419: 416: 412: 405: 399: 395: 387: 386: 385: 371: 344: 341: 331: 327: 316: 300: 297: 277: 257: 250: 245: 231: 225: 221: 201: 198: 195: 175: 172: 169: 166: 159:if for every 158: 142: 122: 115: 105: 103: 100: 99:set-theoretic 96: 92: 88: 87:real analysis 57: 27:, denoted by 26: 22: 4035:Georg Cantor 4030:Paul Bernays 3961:Morse–Kelley 3936: 3869: 3868:Subset  3815:hereditarily 3777:Venn diagram 3735:ordered pair 3650:Intersection 3594:Axiom schema 3522: 3398: 3375: 3372:Jech, Thomas 3367: 3362: 3324:(2): 65–89. 3321: 3317: 3304: 3299: 3281: 3275: 3269: 3244: 3224: 3215: 3211: 3204: 3174: 3168: 3116: 3077:(2): 65–89. 3074: 3068: 3054: 3041: 3034: 2891:Unlike full 2890: 1640: 1453:So, for all 950:well-ordered 915:Zorn's lemma 885: 880: 797: 763: 698: 628: 581: 534:real numbers 511: 483: 479: 472: 470: 246: 155:is called a 111: 91:Paul Bernays 24: 18: 4060:Thomas Jech 3903:Alternative 3882:Uncountable 3836:Ultrafilter 3695:Cardinality 3599:replacement 3540:Determinacy 2821:Therefore, 2775:or it is a 2712:belongs to 1612:Therefore, 1332:is entire, 961:Proof that 881:proof below 853:pruned tree 512:If the set 384:such that 21:mathematics 4055:Kurt Gödel 4040:Paul Cohen 3877:Transitive 3645:Identities 3629:Complement 3616:Operations 3577:Regularity 3545:projective 3508:Adjunction 3467:Set theory 3429:1007.03002 3399:Set Theory 3196:References 2988:satisfies 2333:such that 629:The axiom 214:such that 3988:Paradoxes 3908:Axiomatic 3887:Universal 3863:Singleton 3858:Recursive 3801:Countable 3796:Amorphous 3655:Power set 3572:Power set 3523:dependent 3518:countable 3421:174929965 3354:250344853 3128:⇒ 3107:250344853 2867:⟩ 2864:… 2845:… 2829:⟨ 2800:≥ 2757:≤ 2700:⟩ 2684:… 2668:⟨ 2642:≥ 2616:⟩ 2594:… 2575:… 2559:⟨ 2460:≥ 2449:for some 2437:⟩ 2421:… 2405:⟨ 2247:ω 2192:⁡ 2158:⁡ 2116:⁡ 1995:⟩ 1992:… 1973:… 1957:⟨ 1857:⟩ 1832:… 1816:⟨ 1716:ω 1652:⟹ 1639:is true. 1544:∈ 1541:⟩ 1506:… 1490:⟨ 1464:≥ 1438:⟩ 1435:… 1416:… 1400:⟨ 1360:ω 1288:≤ 1215:∈ 1212:⟩ 1196:… 1180:⟨ 1010:⟸ 981:⟺ 863:ω 689:countable 471:In fact, 448:∈ 345:∈ 244:is true. 199:∈ 170:∈ 4100:Category 3992:Problems 3896:Theories 3872:Superset 3848:Infinite 3677:Concepts 3557:Infinity 3474:Overview 3374:(1973), 3305:See esp. 3241:(1989). 3230:converse 2631:For all 2259:levels, 1768:so that 437:for all 315:sequence 3930:General 3925:Zermelo 3831:subbase 3813: ( 3752:Forcing 3730:Element 3702: ( 3680:Methods 3567:Pairing 3346:0006333 3338:2266303 3251:155–156 3099:0006333 3091:2266303 791:to the 3821:Filter 3811:Finite 3747:Family 3690:Almost 3528:global 3513:Choice 3500:Axioms 3427:  3419:  3409:  3382:  3352:  3344:  3336:  3257:  3181:  3171:table 3105:  3097:  3089:  2219:Since 2189:length 2155:length 2113:length 1869:where 1312:Since 877:branch 409:  229:  102:axioms 23:, the 3913:Naive 3843:Fuzzy 3806:Empty 3789:types 3740:tuple 3710:Class 3704:large 3665:Union 3582:Union 3350:S2CID 3334:JSTOR 3314:(PDF) 3103:S2CID 3087:JSTOR 3065:(PDF) 3046:Notes 2538:Then 1945:is a 1708:with 953:chain 855:with 699:Over 3826:base 3417:OCLC 3407:ISBN 3380:ISBN 3255:ISBN 3228:The 3179:ISBN 2475:Let 2384:Now 2147:and 2128:> 1916:and 1668:Let 1294:< 1277:for 1026:Let 3787:Set 3425:Zbl 3368:see 3326:doi 3286:doi 3169:See 3079:doi 2079:if 1748:on 1230:if 1086:on 883:). 687:of 578:Use 364:in 290:on 249:set 135:on 19:In 4102:: 3423:. 3415:. 3405:. 3348:. 3342:MR 3340:. 3332:. 3316:. 3282:26 3280:, 3253:. 3237:; 3216:25 3214:. 3101:. 3095:MR 3093:. 3085:. 3067:. 2918:, 2463:0. 2207:1. 795:. 112:A 3870:· 3854:) 3850:( 3817:) 3706:) 3459:e 3452:t 3445:v 3431:. 3356:. 3328:: 3322:7 3288:: 3263:. 3187:. 3153:C 3150:D 3109:. 3081:: 3075:7 3014:C 3011:D 3006:+ 3001:F 2998:Z 2958:F 2955:Z 2931:C 2928:D 2904:C 2901:A 2861:, 2856:k 2852:x 2848:, 2842:, 2837:0 2833:x 2809:. 2806:) 2803:m 2797:k 2794:( 2788:n 2784:t 2763:) 2760:m 2754:k 2751:( 2745:0 2741:t 2720:T 2695:k 2691:x 2687:, 2681:, 2676:0 2672:x 2648:, 2645:0 2639:k 2619:. 2611:n 2608:+ 2605:m 2601:x 2597:, 2591:, 2586:m 2582:x 2578:, 2572:, 2567:0 2563:x 2556:= 2551:n 2547:t 2526:. 2521:n 2517:t 2494:n 2491:+ 2488:m 2484:x 2457:m 2432:m 2428:x 2424:, 2418:, 2413:0 2409:x 2402:= 2397:0 2393:t 2372:. 2367:1 2364:+ 2361:n 2357:t 2352:R 2346:n 2342:t 2319:n 2315:t 2292:C 2289:D 2267:R 2227:T 2204:+ 2201:) 2198:u 2195:( 2170:= 2167:) 2164:v 2161:( 2134:, 2131:0 2125:) 2122:u 2119:( 2110:, 2107:v 2087:u 2067:v 2063:R 2059:u 2039:. 2036:n 2033:+ 2030:m 2027:= 2024:) 2021:n 2018:( 2015:f 1989:, 1984:k 1980:x 1976:, 1970:, 1965:0 1961:x 1933:) 1930:n 1927:( 1924:f 1902:1 1899:+ 1896:n 1892:t 1887:R 1882:n 1878:t 1852:) 1849:n 1846:( 1843:f 1839:x 1835:, 1829:, 1824:0 1820:x 1813:= 1808:n 1804:t 1781:C 1778:D 1756:T 1736:R 1696:X 1676:T 1656:) 1648:( 1625:C 1622:D 1600:. 1595:1 1592:+ 1589:n 1585:x 1580:R 1575:n 1571:x 1550:, 1547:T 1536:1 1533:+ 1530:n 1526:x 1522:, 1517:n 1513:x 1509:, 1503:, 1498:0 1494:x 1471:: 1467:0 1461:n 1441:. 1432:, 1427:n 1423:x 1419:, 1413:, 1408:0 1404:x 1380:T 1340:T 1320:R 1300:. 1297:n 1291:k 1285:0 1263:1 1260:+ 1257:k 1253:x 1248:R 1243:k 1239:x 1218:T 1207:n 1203:x 1199:, 1193:, 1188:0 1184:x 1160:. 1157:R 1137:T 1117:. 1114:R 1094:X 1074:T 1054:X 1034:R 1014:) 1006:( 975:C 972:D 930:C 927:D 899:C 896:D 879:( 837:F 834:Z 810:C 807:D 777:F 774:Z 743:C 740:D 726:( 712:F 709:Z 669:C 666:A 642:C 639:D 610:n 590:n 563:. 557:R 550:C 547:D 520:X 497:R 487:0 484:x 480:X 476:0 473:x 456:. 452:N 445:n 423:1 420:+ 417:n 413:x 406:R 400:n 396:x 372:X 349:N 342:n 338:) 332:n 328:x 324:( 301:, 298:X 278:R 258:X 232:b 226:R 222:a 202:X 196:b 176:, 173:X 167:a 143:X 123:R 71:C 68:A 58:( 40:C 37:D

Index

mathematics
axiom of choice
real analysis
Paul Bernays
reverse mathematics
set-theoretic
axioms
homogeneous relation
total relation
set
sequence
real numbers
countably infinite
transfinite recursion
countable
Zermelo–Fraenkel set theory
Baire category theorem
downward Löwenheim–Skolem theorem
pruned tree
branch
Zorn's lemma
partial order
well-ordered
chain
strictly increasing
non-measurable
property of Baire
perfect set property
Solovay model
Lebesgue measurable

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

↑