Countable Length Ramsey Games

Carl Darby and Richard Laver
Additional contact information
Carl Darby: Mesa State College, Department of Computer Science, Mathematics and Statistics
Richard Laver: University of Colorado, Department of Mathematics

A chapter in Set Theory, 1998, pp 41-46 from Springer

Abstract: Abstract It is known that the first player has a winning strategy for the Ramsey game R(α,

Keywords: Order Type; Winning Strategy; Partition Relation; Black Play; Scattered Type (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-8988-8_3

Ordering information: This item can be ordered from
http://www.springer.com/9789401589888

DOI: 10.1007/978-94-015-8988-8_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().