Ramsey Theory and Computability
July 9–13, 2018
Last updated May 22, 2018
Theme: The workshop will focus on the computability-theoretic and proof-theoretic strength of combinatorial principles such as Ramsey’s Theorem for pairs and Hindman’s Theorem.
Schedule, Speakers, Titles, and Abstracts
Registration: Registration is now closed. Here is who is registered. One cannot get into the venue without preregistration. There is no registration fee. If you want to go and have not registered email Peter Cholak.
Venue: The Colosseum was not available but we are a block away at ND Rome Global Gateway. We have one lecture room that sits about 40. There are 2 small white boards and the room is long. So board talks are not suggested. There is space for breaking up into groups for research.
Many Thanks to our Sponsors! Notre Dame Research, Center for Mathematics at Notre Dame, Notre Dame College of Science, Notre Dame Department of Mathematics, NSF, and ASL.
Organizer: Peter Cholak
Program Committee: Lorenzo Carlucci, Peter Cholak (Chair), Damir Dzhafarov, Denis Hirschfeldt, and Ludovic Patey.
Travel Arrangements: Here you are on your own. What follows are some suggestions by the Notre Dame Global Gateway staff. There is also Airbnb. We understand public transportation in Rome is good and you should be able get a hotel or room further out and travel in, if desired.
Map of hotels in relation to Notre Dame Global Gateway.
Suggestions: Suggestions and comments are welcome. The ones that you are willing to implement will be viewed very positively.