Knowledge

Stratification (mathematics)

Source 📝

2669: 2686: 22: 263:
If a predicate P is positively derived from a predicate Q (i.e., P is the head of a rule, and Q occurs positively in the body of the same rule), then the stratification number of P must be greater than or equal to the stratification number of Q, in short
257: 311:
If a predicate P is derived from a negated predicate Q (i.e., P is the head of a rule, and Q occurs negatively in the body of the same rule), then the stratification number of P must be greater than the stratification number of Q, in short
720:, with fixed displacements from the values of each of their (bound) arguments in a (weakly) stratified formula. Defined term constructions are neatly handled by (possibly merely implicitly) using the theory of descriptions: a term 360:
The notion of stratified negation leads to a very effective operational semantics for stratified programs in terms of the stratified least fixpoint, that is obtained by iteratively applying the fixpoint operator to each
798:
A formula is stratified if and only if it is possible to assign types to all variables appearing in the formula in such a way that it will make sense in a version TST of the theory of types described in the
539: 632: 160: 753: 680:
generalizes readily to languages with more predicates and with term constructions. Each primitive predicate needs to have specified required displacements between values of
667: 306: 354: 793: 718: 698: 423: 469: 773: 588: 489: 443: 399: 568: 637:
It turns out that it is sufficient to require that these conditions be satisfied only when both variables in an atomic formula are bound in the set abstract
1048: 700:
at its (bound) arguments in a (weakly) stratified formula. In a language with term constructions, terms themselves need to be assigned values under
1723: 445:(considered as an item of syntax) to a natural number (this works equally well if all integers are used) in such a way that any atomic formula 43: 1806: 947: 94: 2718: 66: 73: 2120: 2278: 2701: 1066: 80: 2133: 1456: 2138: 2128: 1865: 1718: 1071: 62: 1062: 2728: 2274: 113: 1616: 365:
of the program, from the lowest one up. Stratification is not only useful for guaranteeing unique interpretation of
51: 2371: 2115: 940: 1676: 1369: 1110: 2632: 2334: 2097: 2092: 1917: 1338: 1022: 908: 47: 252:{\displaystyle Q_{1}\wedge \dots \wedge Q_{n}\wedge \neg Q_{n+1}\wedge \dots \wedge \neg Q_{n+m}\rightarrow P} 2627: 2410: 2327: 2040: 1971: 1848: 1090: 494: 259:
is stratified if and only if there is a stratification assignment S that fulfills the following conditions:
2694: 2552: 2378: 2064: 1698: 1297: 593: 2723: 2430: 2425: 2035: 1774: 1703: 1032: 933: 827: 87: 2359: 1949: 1343: 1311: 1002: 2649: 2598: 2495: 1993: 1954: 1431: 1076: 723: 640: 2704:
incorrectly led you here, you may wish to change the link to point directly to the intended article.
1105: 2738: 2490: 2420: 1959: 1811: 1794: 1517: 997: 267: 32: 315: 2322: 2299: 2260: 2146: 2087: 1733: 1653: 1497: 1441: 1054: 36: 2612: 2339: 2317: 2284: 2177: 2023: 2008: 1981: 1932: 1816: 1751: 1576: 1542: 1537: 1411: 1242: 1219: 904: 887:
of the topological space). This is not a useful notion when unrestricted; but when the various
150: 2542: 2395: 2187: 1905: 1641: 1547: 1406: 1391: 1272: 1247: 778: 703: 683: 408: 448: 2515: 2477: 2354: 2158: 1998: 1922: 1900: 1728: 1686: 1585: 1552: 1416: 1204: 1115: 876: 818: 758: 573: 474: 428: 384: 8: 2733: 2644: 2535: 2520: 2500: 2457: 2344: 2294: 2220: 2165: 2102: 1895: 1890: 1838: 1606: 1595: 1267: 1167: 1095: 1086: 1082: 1017: 1012: 920: 547: 2673: 2442: 2405: 2390: 2383: 2366: 2170: 2152: 2018: 1944: 1927: 1880: 1693: 1602: 1436: 1421: 1381: 1333: 1318: 1306: 1262: 1237: 1007: 956: 884: 865: 138: 1626: 2668: 2608: 2415: 2225: 2215: 2107: 1988: 1823: 1799: 1580: 1564: 1469: 1446: 1323: 1292: 1257: 1152: 987: 869: 842: 146: 669:
under consideration. A set abstract satisfying this weaker condition is said to be
2622: 2617: 2510: 2467: 2289: 2250: 2245: 2230: 2056: 2013: 1910: 1708: 1658: 1232: 1194: 859: 2603: 2593: 2547: 2530: 2485: 2447: 2349: 2269: 2076: 2003: 1976: 1964: 1870: 1784: 1758: 1713: 1681: 1482: 1284: 1227: 1177: 1142: 1100: 896: 838: 811: 804: 800: 677: 378: 401:
in the language of first-order logic with equality and membership is said to be
2588: 2567: 2525: 2505: 2400: 2255: 1853: 1843: 1833: 1828: 1762: 1636: 1512: 1401: 1396: 1374: 975: 892: 803:
article, and this is probably the best way to understand the stratification of
542: 154: 2697:
includes a list of related items that share the same name (or similar names).
2712: 2562: 2240: 1747: 1532: 1522: 1492: 1477: 1147: 2462: 2309: 2210: 2202: 2082: 2030: 1939: 1875: 1858: 1789: 1648: 1507: 1209: 992: 900: 2572: 2452: 1631: 1621: 1568: 1252: 1172: 1157: 1037: 982: 366: 895:), and fit together manageably, this idea is often applied in geometry. 1502: 1357: 1328: 1134: 891:
are defined by some recognisable set of conditions (for example being
2654: 2557: 1610: 1527: 1487: 1451: 1387: 1199: 1189: 1162: 925: 21: 2639: 2437: 1885: 1590: 1184: 2235: 1027: 2685: 846: 153:
of a logical theory exists. Specifically, we say that a set of
1779: 1125: 970: 822: 903:
first defined formal conditions for stratification. See
817:
A motivation for the use of stratification is to address
868:, there is a different meaning, of a decomposition of a 781: 761: 726: 706: 686: 643: 596: 576: 550: 497: 477: 451: 431: 411: 387: 318: 270: 163: 810:
The notion of stratification can be extended to the
787: 767: 747: 712: 692: 661: 626: 582: 562: 533: 483: 463: 437: 417: 393: 348: 300: 251: 2710: 2691:Index of articles associated with the same name 941: 821:, the antinomy considered to have undermined 814:; this is found in papers of Randall Holmes. 656: 644: 2683: 372: 145:is any consistent assignment of numbers to 50:. Unsourced material may be challenged and 1133: 948: 934: 149:symbols guaranteeing that a unique formal 875:into disjoint subsets each of which is a 381:(NF) and related set theories, a formula 114:Learn how and when to remove this message 775:) must be assigned the same value under 132: 534:{\displaystyle \sigma (x)+1=\sigma (y)} 425:which sends each variable appearing in 2711: 955: 929: 832: 627:{\displaystyle \sigma (x)=\sigma (y)} 48:adding citations to reliable sources 15: 405:if and only if there is a function 129:has several usages in mathematics. 13: 833:Quine, Willard Van Orman (1963) . 224: 196: 14: 2750: 2719:Set index articles on mathematics 63:"Stratification" mathematics 2684: 2667: 914: 20: 748:{\displaystyle (\iota x.\phi )} 662:{\displaystyle \{x\mid \phi \}} 909:topologically stratified space 853: 742: 727: 621: 615: 606: 600: 528: 522: 507: 501: 343: 337: 328: 322: 295: 289: 280: 274: 243: 1: 2628:History of mathematical logic 301:{\displaystyle S(P)\geq S(Q)} 2553:Primitive recursive function 835:From a Logical Point of View 349:{\displaystyle S(P)>S(Q)} 7: 828:Grundgesetze der Arithmetik 10: 2755: 1617:Schröder–Bernstein theorem 1344:Monadic predicate calculus 1003:Foundations of mathematics 879:(so that in particular a 857: 837:(2nd ed.). New York: 2663: 2650:Philosophy of mathematics 2599:Automated theorem proving 2581: 2476: 2308: 2201: 2053: 1770: 1746: 1724:Von Neumann–Bernays–Gödel 1669: 1563: 1467: 1365: 1356: 1283: 1218: 1124: 1046: 963: 2729:Mathematical terminology 373:In a specific set theory 2300:Self-verifying theories 2121:Tarski's axiomatization 1072:Tarski's undefinability 1067:incompleteness theorems 788:{\displaystyle \sigma } 713:{\displaystyle \sigma } 693:{\displaystyle \sigma } 418:{\displaystyle \sigma } 2674:Mathematics portal 2285:Proof of impossibility 1933:propositional variable 1243:Propositional calculus 905:Whitney stratification 789: 769: 749: 714: 694: 676:The stratification of 663: 628: 584: 564: 535: 485: 465: 464:{\displaystyle x\in y} 439: 419: 395: 350: 302: 253: 2543:Kolmogorov complexity 2496:Computably enumerable 2396:Model complete theory 2188:Principia Mathematica 1248:Propositional formula 1077:Banach–Tarski paradox 790: 770: 768:{\displaystyle \phi } 750: 715: 695: 664: 629: 585: 583:{\displaystyle \phi } 565: 536: 486: 484:{\displaystyle \phi } 466: 440: 438:{\displaystyle \phi } 420: 396: 394:{\displaystyle \phi } 351: 303: 254: 133:In mathematical logic 2491:Church–Turing thesis 2478:Computability theory 1687:continuum hypothesis 1205:Square of opposition 1063:Gödel's completeness 877:topological manifold 779: 759: 724: 704: 684: 641: 594: 574: 548: 495: 475: 449: 429: 409: 385: 316: 268: 161: 44:improve this article 2645:Mathematical object 2536:P versus NP problem 2501:Computable function 2295:Reverse mathematics 2221:Logical consequence 2098:primitive recursive 2093:elementary function 1866:Free/bound variable 1719:Tarski–Grothendieck 1238:Logical connectives 1168:Logical equivalence 1018:Logical consequence 921:stratified sampling 795:as the variable x. 563:{\displaystyle x=y} 2724:Mathematical logic 2443:Transfer principle 2406:Semantics of logic 2391:Categorical theory 2367:Non-standard model 1881:Logical connective 1008:Information theory 957:Mathematical logic 866:singularity theory 785: 765: 745: 710: 690: 659: 624: 580: 560: 531: 481: 461: 435: 415: 391: 346: 298: 249: 139:mathematical logic 2695:set index article 2681: 2680: 2613:Abstract category 2416:Theories of truth 2226:Rule of inference 2216:Natural deduction 2197: 2196: 1742: 1741: 1447:Cartesian product 1352: 1351: 1258:Many-valued logic 1233:Boolean functions 1116:Russell's paradox 1091:diagonal argument 988:First-order logic 870:topological space 819:Russell's paradox 755:(the x such that 671:weakly stratified 124: 123: 116: 98: 2746: 2705: 2688: 2672: 2671: 2623:History of logic 2618:Category of sets 2511:Decision problem 2290:Ordinal analysis 2231:Sequent calculus 2129:Boolean algebras 2069: 2068: 2043: 2014:logical/constant 1768: 1767: 1754: 1677:Zermelo–Fraenkel 1428:Set operations: 1363: 1362: 1300: 1131: 1130: 1111:Löwenheim–Skolem 998:Formal semantics 950: 943: 936: 927: 926: 860:Stratified space 850: 839:Harper & Row 825:'s central work 794: 792: 791: 786: 774: 772: 771: 766: 754: 752: 751: 746: 719: 717: 716: 711: 699: 697: 696: 691: 668: 666: 665: 660: 633: 631: 630: 625: 589: 587: 586: 581: 569: 567: 566: 561: 540: 538: 537: 532: 490: 488: 487: 482: 470: 468: 467: 462: 444: 442: 441: 436: 424: 422: 421: 416: 400: 398: 397: 392: 355: 353: 352: 347: 307: 305: 304: 299: 258: 256: 255: 250: 242: 241: 214: 213: 192: 191: 173: 172: 119: 112: 108: 105: 99: 97: 56: 24: 16: 2754: 2753: 2749: 2748: 2747: 2745: 2744: 2743: 2739:Stratifications 2709: 2708: 2707: 2706: 2699: 2698: 2692: 2682: 2677: 2666: 2659: 2604:Category theory 2594:Algebraic logic 2577: 2548:Lambda calculus 2486:Church encoding 2472: 2448:Truth predicate 2304: 2270:Complete theory 2193: 2062: 2058: 2054: 2049: 2041: 1761: and  1757: 1752: 1738: 1714:New Foundations 1682:axiom of choice 1665: 1627:Gödel numbering 1567: and  1559: 1463: 1348: 1298: 1279: 1228:Boolean algebra 1214: 1178:Equiconsistency 1143:Classical logic 1120: 1101:Halting problem 1089: and  1065: and  1053: and  1052: 1047:Theorems ( 1042: 959: 954: 917: 897:Hassler Whitney 862: 856: 812:lambda calculus 805:New Foundations 801:New Foundations 780: 777: 776: 760: 757: 756: 725: 722: 721: 705: 702: 701: 685: 682: 681: 678:New Foundations 642: 639: 638: 595: 592: 591: 575: 572: 571: 549: 546: 545: 496: 493: 492: 476: 473: 472: 450: 447: 446: 430: 427: 426: 410: 407: 406: 386: 383: 382: 379:New Foundations 375: 317: 314: 313: 269: 266: 265: 231: 227: 203: 199: 187: 183: 168: 164: 162: 159: 158: 135: 120: 109: 103: 100: 57: 55: 41: 25: 12: 11: 5: 2752: 2742: 2741: 2736: 2731: 2726: 2721: 2690: 2689: 2679: 2678: 2664: 2661: 2660: 2658: 2657: 2652: 2647: 2642: 2637: 2636: 2635: 2625: 2620: 2615: 2606: 2601: 2596: 2591: 2589:Abstract logic 2585: 2583: 2579: 2578: 2576: 2575: 2570: 2568:Turing machine 2565: 2560: 2555: 2550: 2545: 2540: 2539: 2538: 2533: 2528: 2523: 2518: 2508: 2506:Computable set 2503: 2498: 2493: 2488: 2482: 2480: 2474: 2473: 2471: 2470: 2465: 2460: 2455: 2450: 2445: 2440: 2435: 2434: 2433: 2428: 2423: 2413: 2408: 2403: 2401:Satisfiability 2398: 2393: 2388: 2387: 2386: 2376: 2375: 2374: 2364: 2363: 2362: 2357: 2352: 2347: 2342: 2332: 2331: 2330: 2325: 2318:Interpretation 2314: 2312: 2306: 2305: 2303: 2302: 2297: 2292: 2287: 2282: 2272: 2267: 2266: 2265: 2264: 2263: 2253: 2248: 2238: 2233: 2228: 2223: 2218: 2213: 2207: 2205: 2199: 2198: 2195: 2194: 2192: 2191: 2183: 2182: 2181: 2180: 2175: 2174: 2173: 2168: 2163: 2143: 2142: 2141: 2139:minimal axioms 2136: 2125: 2124: 2123: 2112: 2111: 2110: 2105: 2100: 2095: 2090: 2085: 2072: 2070: 2051: 2050: 2048: 2047: 2046: 2045: 2033: 2028: 2027: 2026: 2021: 2016: 2011: 2001: 1996: 1991: 1986: 1985: 1984: 1979: 1969: 1968: 1967: 1962: 1957: 1952: 1942: 1937: 1936: 1935: 1930: 1925: 1915: 1914: 1913: 1908: 1903: 1898: 1893: 1888: 1878: 1873: 1868: 1863: 1862: 1861: 1856: 1851: 1846: 1836: 1831: 1829:Formation rule 1826: 1821: 1820: 1819: 1814: 1804: 1803: 1802: 1792: 1787: 1782: 1777: 1771: 1765: 1748:Formal systems 1744: 1743: 1740: 1739: 1737: 1736: 1731: 1726: 1721: 1716: 1711: 1706: 1701: 1696: 1691: 1690: 1689: 1684: 1673: 1671: 1667: 1666: 1664: 1663: 1662: 1661: 1651: 1646: 1645: 1644: 1637:Large cardinal 1634: 1629: 1624: 1619: 1614: 1600: 1599: 1598: 1593: 1588: 1573: 1571: 1561: 1560: 1558: 1557: 1556: 1555: 1550: 1545: 1535: 1530: 1525: 1520: 1515: 1510: 1505: 1500: 1495: 1490: 1485: 1480: 1474: 1472: 1465: 1464: 1462: 1461: 1460: 1459: 1454: 1449: 1444: 1439: 1434: 1426: 1425: 1424: 1419: 1409: 1404: 1402:Extensionality 1399: 1397:Ordinal number 1394: 1384: 1379: 1378: 1377: 1366: 1360: 1354: 1353: 1350: 1349: 1347: 1346: 1341: 1336: 1331: 1326: 1321: 1316: 1315: 1314: 1304: 1303: 1302: 1289: 1287: 1281: 1280: 1278: 1277: 1276: 1275: 1270: 1265: 1255: 1250: 1245: 1240: 1235: 1230: 1224: 1222: 1216: 1215: 1213: 1212: 1207: 1202: 1197: 1192: 1187: 1182: 1181: 1180: 1170: 1165: 1160: 1155: 1150: 1145: 1139: 1137: 1128: 1122: 1121: 1119: 1118: 1113: 1108: 1103: 1098: 1093: 1081:Cantor's  1079: 1074: 1069: 1059: 1057: 1044: 1043: 1041: 1040: 1035: 1030: 1025: 1020: 1015: 1010: 1005: 1000: 995: 990: 985: 980: 979: 978: 967: 965: 961: 960: 953: 952: 945: 938: 930: 916: 913: 893:locally closed 881:stratification 858:Main article: 855: 852: 841:. p. 90. 784: 764: 744: 741: 738: 735: 732: 729: 709: 689: 658: 655: 652: 649: 646: 623: 620: 617: 614: 611: 608: 605: 602: 599: 579: 559: 556: 553: 543:atomic formula 530: 527: 524: 521: 518: 515: 512: 509: 506: 503: 500: 480: 460: 457: 454: 434: 414: 390: 374: 371: 358: 357: 345: 342: 339: 336: 333: 330: 327: 324: 321: 309: 297: 294: 291: 288: 285: 282: 279: 276: 273: 248: 245: 240: 237: 234: 230: 226: 223: 220: 217: 212: 209: 206: 202: 198: 195: 190: 186: 182: 179: 176: 171: 167: 151:interpretation 143:stratification 134: 131: 127:Stratification 122: 121: 28: 26: 19: 9: 6: 4: 3: 2: 2751: 2740: 2737: 2735: 2732: 2730: 2727: 2725: 2722: 2720: 2717: 2716: 2714: 2703: 2702:internal link 2696: 2687: 2676: 2675: 2670: 2662: 2656: 2653: 2651: 2648: 2646: 2643: 2641: 2638: 2634: 2631: 2630: 2629: 2626: 2624: 2621: 2619: 2616: 2614: 2610: 2607: 2605: 2602: 2600: 2597: 2595: 2592: 2590: 2587: 2586: 2584: 2580: 2574: 2571: 2569: 2566: 2564: 2563:Recursive set 2561: 2559: 2556: 2554: 2551: 2549: 2546: 2544: 2541: 2537: 2534: 2532: 2529: 2527: 2524: 2522: 2519: 2517: 2514: 2513: 2512: 2509: 2507: 2504: 2502: 2499: 2497: 2494: 2492: 2489: 2487: 2484: 2483: 2481: 2479: 2475: 2469: 2466: 2464: 2461: 2459: 2456: 2454: 2451: 2449: 2446: 2444: 2441: 2439: 2436: 2432: 2429: 2427: 2424: 2422: 2419: 2418: 2417: 2414: 2412: 2409: 2407: 2404: 2402: 2399: 2397: 2394: 2392: 2389: 2385: 2382: 2381: 2380: 2377: 2373: 2372:of arithmetic 2370: 2369: 2368: 2365: 2361: 2358: 2356: 2353: 2351: 2348: 2346: 2343: 2341: 2338: 2337: 2336: 2333: 2329: 2326: 2324: 2321: 2320: 2319: 2316: 2315: 2313: 2311: 2307: 2301: 2298: 2296: 2293: 2291: 2288: 2286: 2283: 2280: 2279:from ZFC 2276: 2273: 2271: 2268: 2262: 2259: 2258: 2257: 2254: 2252: 2249: 2247: 2244: 2243: 2242: 2239: 2237: 2234: 2232: 2229: 2227: 2224: 2222: 2219: 2217: 2214: 2212: 2209: 2208: 2206: 2204: 2200: 2190: 2189: 2185: 2184: 2179: 2178:non-Euclidean 2176: 2172: 2169: 2167: 2164: 2162: 2161: 2157: 2156: 2154: 2151: 2150: 2148: 2144: 2140: 2137: 2135: 2132: 2131: 2130: 2126: 2122: 2119: 2118: 2117: 2113: 2109: 2106: 2104: 2101: 2099: 2096: 2094: 2091: 2089: 2086: 2084: 2081: 2080: 2078: 2074: 2073: 2071: 2066: 2060: 2055:Example  2052: 2044: 2039: 2038: 2037: 2034: 2032: 2029: 2025: 2022: 2020: 2017: 2015: 2012: 2010: 2007: 2006: 2005: 2002: 2000: 1997: 1995: 1992: 1990: 1987: 1983: 1980: 1978: 1975: 1974: 1973: 1970: 1966: 1963: 1961: 1958: 1956: 1953: 1951: 1948: 1947: 1946: 1943: 1941: 1938: 1934: 1931: 1929: 1926: 1924: 1921: 1920: 1919: 1916: 1912: 1909: 1907: 1904: 1902: 1899: 1897: 1894: 1892: 1889: 1887: 1884: 1883: 1882: 1879: 1877: 1874: 1872: 1869: 1867: 1864: 1860: 1857: 1855: 1852: 1850: 1847: 1845: 1842: 1841: 1840: 1837: 1835: 1832: 1830: 1827: 1825: 1822: 1818: 1815: 1813: 1812:by definition 1810: 1809: 1808: 1805: 1801: 1798: 1797: 1796: 1793: 1791: 1788: 1786: 1783: 1781: 1778: 1776: 1773: 1772: 1769: 1766: 1764: 1760: 1755: 1749: 1745: 1735: 1732: 1730: 1727: 1725: 1722: 1720: 1717: 1715: 1712: 1710: 1707: 1705: 1702: 1700: 1699:Kripke–Platek 1697: 1695: 1692: 1688: 1685: 1683: 1680: 1679: 1678: 1675: 1674: 1672: 1668: 1660: 1657: 1656: 1655: 1652: 1650: 1647: 1643: 1640: 1639: 1638: 1635: 1633: 1630: 1628: 1625: 1623: 1620: 1618: 1615: 1612: 1608: 1604: 1601: 1597: 1594: 1592: 1589: 1587: 1584: 1583: 1582: 1578: 1575: 1574: 1572: 1570: 1566: 1562: 1554: 1551: 1549: 1546: 1544: 1543:constructible 1541: 1540: 1539: 1536: 1534: 1531: 1529: 1526: 1524: 1521: 1519: 1516: 1514: 1511: 1509: 1506: 1504: 1501: 1499: 1496: 1494: 1491: 1489: 1486: 1484: 1481: 1479: 1476: 1475: 1473: 1471: 1466: 1458: 1455: 1453: 1450: 1448: 1445: 1443: 1440: 1438: 1435: 1433: 1430: 1429: 1427: 1423: 1420: 1418: 1415: 1414: 1413: 1410: 1408: 1405: 1403: 1400: 1398: 1395: 1393: 1389: 1385: 1383: 1380: 1376: 1373: 1372: 1371: 1368: 1367: 1364: 1361: 1359: 1355: 1345: 1342: 1340: 1337: 1335: 1332: 1330: 1327: 1325: 1322: 1320: 1317: 1313: 1310: 1309: 1308: 1305: 1301: 1296: 1295: 1294: 1291: 1290: 1288: 1286: 1282: 1274: 1271: 1269: 1266: 1264: 1261: 1260: 1259: 1256: 1254: 1251: 1249: 1246: 1244: 1241: 1239: 1236: 1234: 1231: 1229: 1226: 1225: 1223: 1221: 1220:Propositional 1217: 1211: 1208: 1206: 1203: 1201: 1198: 1196: 1193: 1191: 1188: 1186: 1183: 1179: 1176: 1175: 1174: 1171: 1169: 1166: 1164: 1161: 1159: 1156: 1154: 1151: 1149: 1148:Logical truth 1146: 1144: 1141: 1140: 1138: 1136: 1132: 1129: 1127: 1123: 1117: 1114: 1112: 1109: 1107: 1104: 1102: 1099: 1097: 1094: 1092: 1088: 1084: 1080: 1078: 1075: 1073: 1070: 1068: 1064: 1061: 1060: 1058: 1056: 1050: 1045: 1039: 1036: 1034: 1031: 1029: 1026: 1024: 1021: 1019: 1016: 1014: 1011: 1009: 1006: 1004: 1001: 999: 996: 994: 991: 989: 986: 984: 981: 977: 974: 973: 972: 969: 968: 966: 962: 958: 951: 946: 944: 939: 937: 932: 931: 928: 924: 922: 915:In statistics 912: 910: 906: 902: 898: 894: 890: 886: 882: 878: 874: 871: 867: 861: 851: 848: 844: 840: 836: 830: 829: 824: 820: 815: 813: 808: 807:in practice. 806: 802: 796: 782: 762: 739: 736: 733: 730: 707: 687: 679: 674: 672: 653: 650: 647: 635: 618: 612: 609: 603: 597: 577: 570:appearing in 557: 554: 551: 544: 525: 519: 516: 513: 510: 504: 498: 478: 471:appearing in 458: 455: 452: 432: 412: 404: 388: 380: 370: 368: 364: 340: 334: 331: 325: 319: 310: 292: 286: 283: 277: 271: 262: 261: 260: 246: 238: 235: 232: 228: 221: 218: 215: 210: 207: 204: 200: 193: 188: 184: 180: 177: 174: 169: 165: 156: 152: 148: 144: 140: 130: 128: 118: 115: 107: 104:December 2009 96: 93: 89: 86: 82: 79: 75: 72: 68: 65: â€“  64: 60: 59:Find sources: 53: 49: 45: 39: 38: 34: 29:This article 27: 23: 18: 17: 2665: 2463:Ultraproduct 2310:Model theory 2275:Independence 2211:Formal proof 2203:Proof theory 2186: 2159: 2116:real numbers 2088:second-order 1999:Substitution 1876:Metalanguage 1817:conservative 1790:Axiom schema 1734:Constructive 1704:Morse–Kelley 1670:Set theories 1649:Aleph number 1642:inaccessible 1548:Grothendieck 1432:intersection 1319:Higher-order 1307:Second-order 1253:Truth tables 1210:Venn diagram 993:Formal proof 918: 888: 880: 872: 863: 834: 826: 816: 809: 797: 675: 670: 636: 402: 376: 362: 359: 157:of the form 142: 136: 126: 125: 110: 101: 91: 84: 77: 70: 58: 42:Please help 30: 2573:Type theory 2521:undecidable 2453:Truth value 2340:equivalence 2019:non-logical 1632:Enumeration 1622:Isomorphism 1569:cardinality 1553:Von Neumann 1518:Ultrafilter 1483:Uncountable 1417:equivalence 1334:Quantifiers 1324:Fixed-point 1293:First-order 1173:Consistency 1158:Proposition 1135:Traditional 1106:Lindström's 1096:Compactness 1038:Type theory 983:Cardinality 883:defines a 854:In topology 369:theories. 367:Horn clause 2734:Set theory 2713:Categories 2384:elementary 2077:arithmetic 1945:Quantifier 1923:functional 1795:Expression 1513:Transitive 1457:identities 1442:complement 1375:hereditary 1358:Set theory 590:satisfies 491:satisfies 403:stratified 74:newspapers 2655:Supertask 2558:Recursion 2516:decidable 2350:saturated 2328:of models 2251:deductive 2246:axiomatic 2166:Hilbert's 2153:Euclidean 2134:canonical 2057:axiomatic 1989:Signature 1918:Predicate 1807:Extension 1729:Ackermann 1654:Operation 1533:Universal 1523:Recursive 1498:Singleton 1493:Inhabited 1478:Countable 1468:Types of 1452:power set 1422:partition 1339:Predicate 1285:Predicate 1200:Syllogism 1190:Soundness 1163:Inference 1153:Tautology 1055:paradoxes 901:RenĂ© Thom 885:partition 783:σ 763:ϕ 740:ϕ 731:ι 708:σ 688:σ 654:ϕ 651:∣ 613:σ 598:σ 578:ϕ 520:σ 499:σ 479:ϕ 456:∈ 433:ϕ 413:σ 389:ϕ 284:≥ 244:→ 225:¬ 222:∧ 219:⋯ 216:∧ 197:¬ 194:∧ 181:∧ 178:⋯ 175:∧ 147:predicate 31:does not 2640:Logicism 2633:timeline 2609:Concrete 2468:Validity 2438:T-schema 2431:Kripke's 2426:Tarski's 2421:semantic 2411:Strength 2360:submodel 2355:spectrum 2323:function 2171:Tarski's 2160:Elements 2147:geometry 2103:Robinson 2024:variable 2009:function 1982:spectrum 1972:Sentence 1928:variable 1871:Language 1824:Relation 1785:Automata 1775:Alphabet 1759:language 1613:-jection 1591:codomain 1577:Function 1538:Universe 1508:Infinite 1412:Relation 1195:Validity 1185:Argument 1083:theorem, 847:61-15277 831:(1902). 541:and any 2582:Related 2379:Diagram 2277: ( 2256:Hilbert 2241:Systems 2236:Theorem 2114:of the 2059:systems 1839:Formula 1834:Grammar 1750: ( 1694:General 1407:Forcing 1392:Element 1312:Monadic 1087:paradox 1028:Theorem 964:General 363:stratum 155:clauses 88:scholar 52:removed 37:sources 2700:If an 2345:finite 2108:Skolem 2061:  2036:Theory 2004:Symbol 1994:String 1977:atomic 1854:ground 1849:closed 1844:atomic 1800:ground 1763:syntax 1659:binary 1586:domain 1503:Finite 1268:finite 1126:Logics 1085:  1033:Theory 889:strata 845:  90:  83:  76:  69:  61:  2693:This 2335:Model 2083:Peano 1940:Proof 1780:Arity 1709:Naive 1596:image 1528:Fuzzy 1488:Empty 1437:union 1382:Class 1023:Model 1013:Lemma 971:Axiom 823:Frege 95:JSTOR 81:books 2458:Type 2261:list 2065:list 2042:list 2031:Term 1965:rank 1859:open 1753:list 1565:Maps 1470:sets 1329:Free 1299:list 1049:list 976:list 919:See 907:and 899:and 843:LCCN 332:> 67:news 35:any 33:cite 2145:of 2127:of 2075:of 1607:Sur 1581:Map 1388:Ur- 1370:Set 864:In 377:In 137:In 46:by 2715:: 2531:NP 2155:: 2149:: 2079:: 1756:), 1611:Bi 1603:In 923:. 911:. 673:. 634:. 141:, 2611:/ 2526:P 2281:) 2067:) 2063:( 1960:∀ 1955:! 1950:∃ 1911:= 1906:↔ 1901:→ 1896:∧ 1891:√ 1886:ÂŹ 1609:/ 1605:/ 1579:/ 1390:) 1386:( 1273:∞ 1263:3 1051:) 949:e 942:t 935:v 873:X 849:. 743:) 737:. 734:x 728:( 657:} 648:x 645:{ 622:) 619:y 616:( 610:= 607:) 604:x 601:( 558:y 555:= 552:x 529:) 526:y 523:( 517:= 514:1 511:+ 508:) 505:x 502:( 459:y 453:x 356:. 344:) 341:Q 338:( 335:S 329:) 326:P 323:( 320:S 308:. 296:) 293:Q 290:( 287:S 281:) 278:P 275:( 272:S 247:P 239:m 236:+ 233:n 229:Q 211:1 208:+ 205:n 201:Q 189:n 185:Q 170:1 166:Q 117:) 111:( 106:) 102:( 92:· 85:· 78:· 71:· 54:. 40:.

Index


cite
sources
improve this article
adding citations to reliable sources
removed
"Stratification" mathematics
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message
mathematical logic
predicate
interpretation
clauses
Horn clause
New Foundations
atomic formula
New Foundations
New Foundations
New Foundations
lambda calculus
Russell's paradox
Frege
Grundgesetze der Arithmetik
Harper & Row
LCCN
61-15277

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

↑