
Saturday, June 12, 1999 


ARRIVAL 

5:006:00 
DINNER 





Sunday, June 13, 1999


Time 
Speaker 
Area 
6:308:00 
BREAKFAST 

8:208:25 
Steffen Lempp, UWMadison 
Opening Remarks 
8:309:15 
Sergey Goncharov,
Novosibirsk 
computable model
theory 

BREAK 

10:3010:50 
Julia
Knight, Notre Dame 
models of arithmetic 
11:0011:20 
Serikzhan Badaev, Almaty 
numeration theory 
11:301:00 
LUNCH 

1:302:15 
Jeff Remmel, San Diego 
computable algebra 

BREAK 

3:303:50 
Bakh Khoussainov, Auckland 
issues in computable
presentations of models 
4:004:20 
Mikhail Peretyat'kin, Almaty 
finitely axiomatizable
theories and Lindenbaum algebras 
5:006:00 
DINNER 

evening 
WELCOME RECEPTION 





Monday, June 14, 1999 

Time 
Speaker 
Area 
6:308:00 
BREAKFAST 

8:309:15 
Peter Cholak, Notre Dame 
lattice of computably
enumerable sets 

BREAK 

10:1511:00 
Bob Soare, Chicago 
lattice of computably
enumerable sets 
11:1011:30 
Klaus
AmbosSpies, Heidelberg 
genericity and
randomness 
11:301:00 
LUNCH 

1:304:50 
Barry
Cooper, Leeds 
proof
of the automorphism theorem, part 1 
5:006:00 
DINNER 

7:0010:00 
Barry
Cooper, Leeds 
proof
of the automorphism theorem, part 2 




Tuesday, June 15, 1999 

Time 
Speaker 
Area 
6:308:00 
BREAKFAST 

8:309:15 
André Nies,
Chicago 
definability
and coding 

BREAK 

10:1511:00 
Richard Shore, Cornell 
natural definability
in degree structures 
11:1011:30 
Gerald Sacks,
Harvard & MIT 
higher recursion
theory 
11:301:00 
LUNCH 

afternoon 
FREE TIME (for hikes or discussions) 

evening 
BARBECUE DINNER (on Flagstaff Mountain) 





Wednesday, June 16, 1999 

Time 
Speaker 
Area 
6:308:00 
BREAKFAST 

8:309:15 
Steve Simpson, Penn
State 
reverse mathematics 

BREAK 

10:3011:00 
Carl Jockusch, Urbana 
Pi^{0}_{1}
classes and computable combinatorics 
11:1011:30 
Chi Tat Chong,
Singapore 
reverse computability
theory 
11:301:00 
LUNCH 

1:302:15 
Harvey
Friedman, Ohio State 
reverse mathematics 

BREAK 

3:303:50 
Sasha Shlapentokh,
E. Carolina 
issues related
to Hilbert's Tenth Problem 
4:004:20 
Anil Nerode, Cornell 
computable analysis
and topology 
5:006:00 
DINNER 





CONTRIBUTED TALKS 
Title 
7:007:15 
Bob Soare, Chicago 
Computability
and differential geometry 
7:207:35 
Yuri Ershov, Novosibirsk 
Computability in HF over a dense linear order 
7:407:55 
Doug Cenzer, University
of Florida 
The lattice
of Pi^{0}_{1} classes 
8:008:15 
Eberhard Herrmann, Humboldt University, Berlin 
The definability
of the Sigma_{4}acceptable ideals 
8:208:35 
Steve Simpson, Penn
State 
A Mailing List
for Foundations of Mathematics 




Thursday, June 17, 1999 

Time 
Speaker 
Area 
6:308:00 
BREAKFAST 

8:309:15 
Ted Slaman, Berkeley 
applications
of recursion theoretic methods in set theory 

BREAK 

10:2010:50 
Alekos Kechris,
Cal Tech 
Borel equivalence
relations 
11:0011:20 
Marcia Groszek, Dartmouth 
independence
results (from ZFC) in recursion theory 
11:301:00 
LUNCH 

1:302:15 
Manny Lerman,
Connecticut 
lattice embeddings
into the computably enumerable degrees 

BREAK 

3:303:50 
Andrea Sorbi, Siena 
enumeration
degrees 
4:004:20 
Marat
Arslanov, Kazan 
d.c.e. and nc.e.
degrees 
5:006:00 
DINNER 





Friday, June 18, 1999


6:308:00 
BREAKFAST 


DEPARTURE 
