Knowledge (XXG)

Nice name

Source đź“ť

656: 373: 483: 614: 528: 153: 105: 576: 423: 397: 320: 198: 68: 554: 298: 278: 258: 218: 35:
to impose an upper bound on the number of subsets in the generic model. It is used in the context of forcing to prove independence results in set theory such as
238: 173: 125: 328: 697: 428: 636: 70: 716: 690: 581: 495: 721: 130: 683: 76: 32: 17: 36: 559: 402: 380: 303: 181: 50: 632: 667: 631:. Studies in logic and the foundations of mathematics. Vol. 102. Elsevier. p. 208. 533: 283: 263: 243: 203: 223: 158: 110: 710: 368:{\displaystyle \operatorname {dom} (\eta )\subseteq \operatorname {dom} (\tau )} 663: 24: 478:{\displaystyle \{p\in \mathbb {P} |\langle \sigma ,p\rangle \in \eta \}} 655: 16:
This article is about mathematics. For the name "Nice", see
671: 584: 562: 536: 498: 431: 405: 383: 331: 306: 286: 266: 246: 226: 206: 184: 161: 133: 113: 79: 53: 629:Set theory: an introduction to independence proofs 609:{\displaystyle \langle \sigma ,q\rangle \in \tau } 608: 570: 548: 523:{\displaystyle \langle \sigma ,p\rangle \in \eta } 522: 477: 417: 391: 367: 314: 292: 272: 252: 232: 212: 192: 167: 147: 119: 99: 62: 691: 8: 597: 585: 511: 499: 472: 463: 451: 432: 322:-name satisfying the following properties: 698: 684: 583: 564: 563: 561: 535: 497: 446: 442: 441: 430: 404: 385: 384: 382: 330: 308: 307: 305: 285: 265: 245: 225: 205: 186: 185: 183: 160: 141: 140: 132: 112: 84: 83: 78: 52: 148:{\displaystyle G\subseteq \mathbb {P} } 7: 652: 650: 100:{\displaystyle (\mathbb {P} ,<)} 670:. You can help Knowledge (XXG) by 14: 654: 260:is a nice name for a subset of 447: 362: 356: 344: 338: 94: 80: 1: 571:{\displaystyle \mathbb {P} } 418:{\displaystyle \sigma \in M} 392:{\displaystyle \mathbb {P} } 315:{\displaystyle \mathbb {P} } 193:{\displaystyle \mathbb {P} } 738: 649: 15: 63:{\displaystyle M\models } 627:Kunen, Kenneth (1980). 549:{\displaystyle q\geq p} 666:-related article is a 610: 572: 550: 524: 479: 419: 393: 369: 316: 294: 274: 254: 234: 214: 194: 169: 149: 121: 101: 64: 717:Forcing (mathematics) 611: 573: 551: 525: 480: 420: 394: 370: 317: 295: 293:{\displaystyle \eta } 275: 273:{\displaystyle \tau } 255: 253:{\displaystyle \eta } 235: 215: 213:{\displaystyle \tau } 195: 170: 150: 122: 102: 65: 18:Nice (disambiguation) 582: 560: 534: 530:, then there exists 496: 485:forms an antichain. 429: 403: 381: 329: 304: 284: 264: 244: 224: 204: 182: 159: 131: 111: 107:a forcing notion in 77: 51: 606: 568: 546: 520: 490:(Natural addition) 475: 415: 389: 365: 312: 290: 270: 250: 230: 210: 190: 165: 145: 117: 97: 60: 679: 678: 233:{\displaystyle M} 168:{\displaystyle M} 120:{\displaystyle M} 43:Formal definition 729: 722:Set theory stubs 700: 693: 686: 658: 651: 642: 615: 613: 612: 607: 577: 575: 574: 569: 567: 555: 553: 552: 547: 529: 527: 526: 521: 484: 482: 481: 476: 450: 445: 424: 422: 421: 416: 398: 396: 395: 390: 388: 374: 372: 371: 366: 321: 319: 318: 313: 311: 299: 297: 296: 291: 279: 277: 276: 271: 259: 257: 256: 251: 239: 237: 236: 231: 219: 217: 216: 211: 199: 197: 196: 191: 189: 174: 172: 171: 166: 155:is generic over 154: 152: 151: 146: 144: 126: 124: 123: 118: 106: 104: 103: 98: 87: 69: 67: 66: 61: 37:Easton's theorem 737: 736: 732: 731: 730: 728: 727: 726: 707: 706: 705: 704: 647: 645: 639: 626: 622: 580: 579: 558: 557: 532: 531: 494: 493: 427: 426: 401: 400: 379: 378: 327: 326: 302: 301: 282: 281: 262: 261: 242: 241: 222: 221: 202: 201: 180: 179: 157: 156: 129: 128: 109: 108: 75: 74: 73:be transitive, 49: 48: 45: 21: 12: 11: 5: 735: 733: 725: 724: 719: 709: 708: 703: 702: 695: 688: 680: 677: 676: 659: 644: 643: 637: 623: 621: 618: 605: 602: 599: 596: 593: 590: 587: 566: 545: 542: 539: 519: 516: 513: 510: 507: 504: 501: 474: 471: 468: 465: 462: 459: 456: 453: 449: 444: 440: 437: 434: 414: 411: 408: 387: 364: 361: 358: 355: 352: 349: 346: 343: 340: 337: 334: 310: 289: 269: 249: 240:, we say that 229: 209: 188: 164: 143: 139: 136: 127:, and suppose 116: 96: 93: 90: 86: 82: 59: 56: 44: 41: 13: 10: 9: 6: 4: 3: 2: 734: 723: 720: 718: 715: 714: 712: 701: 696: 694: 689: 687: 682: 681: 675: 673: 669: 665: 660: 657: 653: 648: 640: 638:0-444-85401-0 634: 630: 625: 624: 619: 617: 603: 600: 594: 591: 588: 543: 540: 537: 517: 514: 508: 505: 502: 491: 486: 469: 466: 460: 457: 454: 438: 435: 412: 409: 406: 375: 359: 353: 350: 347: 341: 335: 332: 323: 287: 267: 247: 227: 207: 178:Then for any 176: 162: 137: 134: 114: 91: 88: 72: 57: 54: 42: 40: 38: 34: 30: 26: 19: 672:expanding it 661: 646: 628: 489: 487: 377:(2) For all 376: 324: 177: 46: 28: 22: 31:is used in 711:Categories 664:set theory 620:References 578:such that 25:set theory 604:τ 601:∈ 598:⟩ 589:σ 586:⟨ 541:≥ 518:η 515:∈ 512:⟩ 503:σ 500:⟨ 470:η 467:∈ 464:⟩ 455:σ 452:⟨ 439:∈ 410:∈ 407:σ 360:τ 354:⁡ 348:⊆ 342:η 336:⁡ 288:η 268:τ 248:η 208:τ 138:⊆ 58:⊨ 29:nice name 399:-names 33:forcing 635:  200:-name 662:This 492:: If 300:is a 668:stub 633:ISBN 488:(3) 325:(1) 92:< 47:Let 27:, a 556:in 351:dom 333:dom 280:if 220:in 71:ZFC 23:In 713:: 616:. 425:, 175:. 39:. 699:e 692:t 685:v 674:. 641:. 595:q 592:, 565:P 544:p 538:q 509:p 506:, 473:} 461:p 458:, 448:| 443:P 436:p 433:{ 413:M 386:P 363:) 357:( 345:) 339:( 309:P 228:M 187:P 163:M 142:P 135:G 115:M 95:) 89:, 85:P 81:( 55:M 20:.

Index

Nice (disambiguation)
set theory
forcing
Easton's theorem
ZFC
ISBN
0-444-85401-0
Stub icon
set theory
stub
expanding it
v
t
e
Categories
Forcing (mathematics)
Set theory stubs

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

↑