Review: James E. Baumgartner, Generic Graph Construction; Matthew Foreman, Richard Laver, Some Downwards Transfer Properties for $mathscr{N}_2$; Saharon Shelah, A. Baker, B. Bollobas, A. Hajnal, Incompactness for Chromatic Numbers of Graphs [Book Review]

Bulletin of Symbolic Logic 7 (4):539-541 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
0♯ and some forcing principles.Matthew Foreman, Menachem Magidor & Saharon Shelah - 1986 - Journal of Symbolic Logic 51 (1):39 - 46.
Wild edge colourings of graphs.Mirna Džamonja, Péter Komjáth & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255 - 264.
Incompactness in regular cardinals.Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):195-228.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP
2013-11-21

Downloads
29 (#548,167)

6 months
12 (#209,539)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.

Add more references