| Record ID | harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:112151047:1878 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:112151047:1878?format=raw |
LEADER: 01878cam a2200301Ia 4500
001 013097822-1
005 20130805133134.0
008 120119s2012 enka b 001 0 eng d
016 7 $a015879504$2Uk
020 $a9781447121725
020 $a1447121724
035 0 $aocn773288438
040 $aCBU$cCBU$dYDXCP$dBWX$dMUU$dBTCTA$dUKMGB$dCDX$dMUU
050 4 $aQA248$b.H35 2012
082 04 $a511.3/22$223
100 1 $aHalbeisen, Lorenz J.
245 10 $aCombinatorial set theory :$bwith a gentle introduction to forcing /$cLorenz J. Halbeisen.
260 $aLondon ;$aNew York :$bSpringer,$cc2012.
300 $axvi, 453 p. :$bill. ;$c24 cm.
490 1 $aSpringer monographs in mathematics,$x1439-7382
504 $aIncludes bibliographical references and indexes.
505 0 $a1.The setting -- 2. Overture: Ramsey's theorem -- 3. The axioms of Zermelo-Fraenkel set theory -- 4. Cardinal relations in ZF only -- 5. The axiom of choice -- 6. How to make two balls from one -- 7. Models of set theory with atoms -- 8. Twelve cardinals and their relations -- 9. The shattering number revisited -- 10. Happy families and their relatives -- 11. Coda: a dual form of Ramsey's theorem -- 12. The idea of forcing -- 13. Martin's axiom -- 14. The notion of forcing -- 15. Models of finite fragments of set theory -- 16. Proving unprovability -- 17. Models in which AC fails -- 18. Combining forcing notions -- 19. Models in which p=c -- 20. Properties of forcing extensions -- 21. Cohen forcing revisited -- 22. Silver-like forcing notions -- 23. Miller forcing -- 24. Mathias forcing -- 25. On the existence of Ramsey ultrafilters -- 26. Combinatorial properties of sets of partitions -- 27. Suite.
650 0 $aCombinatorial set theory.
650 0 $aForcing (Model theory)
830 0 $aSpringer monographs in mathematics.
988 $a20120214
049 $aSYSS
906 $0OCLC