|
|
Registration
|
12:00pm |
|
|
|
|
Lecture 1
|
1:30pm
|
Barbara Csima (U. Waterloo)
|
Examining Effectiveness of Fraïssé Limits
|
|
|
Lecture 2
|
2:30pm |
Peter Cholak (U. Notre Dame)
|
The computable enumerable sets: the past, the present and the future
|
|
|
Coffee Break
|
3:30pm |
|
|
Lecture 3
|
4:00pm |
Mirna Dzamonja (U. East Anglia)
|
Some results about compact spaces
|
| |
|
|
Breakfast
|
9:00am |
|
|
Lecture 4
|
9:30am
|
Rebecca Weber (Dartmouth)
|
Randomness and Π20 Nullsets
|
|
|
Lecture 5
|
10:30am
|
Rahim Moosa (U. Waterloo)
|
Groups in nonstandard compact complex manifolds
|
|
|
Coffee Break
|
11:30am
|
|
|
|
Lecture 6
|
12:00pm
|
Benjamin Miller (UCLA)
|
The descriptive set theory of quotient spaces
|
|
|
Lunch
|
1:00pm |
|
|
Lecture 7
|
2:00pm |
Joseph Miller (U. Connecticut)
|
Lowness Notions, Measure and Domination
|
|
|
Lecture 8
|
3:00pm |
Jessica Young (U. British Columbia)
|
Amalgamation in Scott fragments
|
|
|
Coffee Break
|
4:00pm
|
|
|
Contributed Talks
|
|
|
|
Session 1
Room 2-131
|
4:30pm |
Joel Hamkins (CUNY)
|
The modal logic of forcing
|
|
|
|
5:00pm |
Paul Brodhead (U. Florida)
|
Random Closed Sets
|
|
|
|
5:30pm |
David Milovich (U. Wisconsin)
|
Reflecting cones on boolean algebras
|
|
|
|
6:00pm |
Francois Dorais (Dartmouth)
|
Souslin Trees and Degrees of Constructibility
|
| |
|
|
Session 2
Room 2-135
|
4:30pm |
Bernard Anderson (UC Berkeley)
|
Reals n-generic relative to a perfect tree
|
|
|
|
5:00pm |
Victoria Gitman (CUNY)
|
Does proper forcing give new instances of Scott's Problem?
|
|
|
|
5:30pm |
Assaf Hasson (Oxford)
|
Characterizing algebraic functions in model theoretic terms
|
| |
|
|
Session 3
Room 2-136
|
4:30pm |
Dan Willard (SUNY Albany)
|
On the Nature of Gödel's Second Incompleteness Theorem
|
|
|
|
5:00pm |
Thomas Johnstone (CUNY)
|
Weakly Compact Cardinals Made Indestructible
|
|
|
|
5:30pm |
Jonas Reitz (CUNY)
|
The Ground Axiom
|
|
|
Banquet at the Ashdown House
|
7:00pm |
| |
|
|
Breakfast
|
9:30am |
|
|
Lecture 9
|
10:00am
|
Heike Mildenberger (U. Vienna)
|
On the number of near coherence classes of ultrafilters
|
|
|
Lecture 10
|
11:00am
|
Antonio Montalban (U. Chicago)
|
Well-quasi-orderings and computability theory
|