Program of the AMS Summer Research Conference on Computability Theory and
Applications
(For general information about this meeting, check the conference
home page,
the AMS summer research
conference home page, and the AMS
Brochure of Information.)
All talks will be held in Engineering 265.
There will be small classrooms with blackboards available nearby for
small-group discussions.
|
Saturday, June 12, 1999 |
|
|
ARRIVAL |
|
| 5:00-6:00 |
DINNER |
|
|
|
|
|
Sunday, June 13, 1999
|
|
| Time |
Speaker |
Area |
| 6:30-8:00 |
BREAKFAST |
|
| 8:20-8:25 |
Steffen Lempp, UW-Madison |
Opening Remarks |
| 8:30-9:15 |
Sergey Goncharov,
Novosibirsk |
computable model
theory |
|
BREAK |
|
| 10:30-10:50 |
Julia
Knight, Notre Dame |
models of arithmetic |
| 11:00-11:20 |
Serikzhan Badaev, Almaty |
numeration theory |
| 11:30-1:00 |
LUNCH |
|
| 1:30-2:15 |
Jeff Remmel, San Diego |
computable algebra |
|
BREAK |
|
| 3:30-3:50 |
Bakh Khoussainov, Auckland |
issues in computable
presentations of models |
| 4:00-4:20 |
Mikhail Peretyat'kin, Almaty |
finitely axiomatizable
theories and Lindenbaum algebras |
| 5:00-6:00 |
DINNER |
|
| evening |
WELCOME RECEPTION |
|
|
|
|
|
Monday, June 14, 1999 |
|
| Time |
Speaker |
Area |
| 6:30-8:00 |
BREAKFAST |
|
| 8:30-9:15 |
Peter Cholak, Notre Dame |
lattice of computably
enumerable sets |
|
BREAK |
|
| 10:15-11:00 |
Bob Soare, Chicago |
lattice of computably
enumerable sets |
| 11:10-11:30 |
Klaus
Ambos-Spies, Heidelberg |
genericity and
randomness |
| 11:30-1:00 |
LUNCH |
|
| 1:30-4:50 |
Barry
Cooper, Leeds |
proof
of the automorphism theorem, part 1 |
| 5:00-6:00 |
DINNER |
|
| 7:00-10:00 |
Barry
Cooper, Leeds |
proof
of the automorphism theorem, part 2 |
|
|
|
|
Tuesday, June 15, 1999 |
|
| Time |
Speaker |
Area |
| 6:30-8:00 |
BREAKFAST |
|
| 8:30-9:15 |
André Nies,
Chicago |
definability
and coding |
|
BREAK |
|
| 10:15-11:00 |
Richard Shore, Cornell |
natural definability
in degree structures |
| 11:10-11:30 |
Gerald Sacks,
Harvard & MIT |
higher recursion
theory |
| 11:30-1:00 |
LUNCH |
|
| afternoon |
FREE TIME (for hikes or discussions) |
|
| evening |
BARBECUE DINNER (on Flagstaff Mountain) |
|
|
|
|
|
Wednesday, June 16, 1999 |
|
| Time |
Speaker |
Area |
| 6:30-8:00 |
BREAKFAST |
|
| 8:30-9:15 |
Steve Simpson, Penn
State |
reverse mathematics |
|
BREAK |
|
| 10:30-11:00 |
Carl Jockusch, Urbana |
Pi01
classes and computable combinatorics |
| 11:10-11:30 |
Chi Tat Chong,
Singapore |
reverse computability
theory |
| 11:30-1:00 |
LUNCH |
|
| 1:30-2:15 |
Harvey
Friedman, Ohio State |
reverse mathematics |
|
BREAK |
|
| 3:30-3:50 |
Sasha Shlapentokh,
E. Carolina |
issues related
to Hilbert's Tenth Problem |
| 4:00-4:20 |
Anil Nerode, Cornell |
computable analysis
and topology |
| 5:00-6:00 |
DINNER |
|
|
|
|
|
CONTRIBUTED TALKS |
Title |
| 7:00-7:15 |
Bob Soare, Chicago |
Computability
and differential geometry |
| 7:20-7:35 |
Yuri Ershov, Novosibirsk |
Computability in HF over a dense linear order |
| 7:40-7:55 |
Doug Cenzer, University
of Florida |
The lattice
of Pi01 classes |
| 8:00-8:15 |
Eberhard Herrmann, Humboldt University, Berlin |
The definability
of the Sigma4-acceptable ideals |
| 8:20-8:35 |
Steve Simpson, Penn
State |
A Mailing List
for Foundations of Mathematics |
|
|
|
|
Thursday, June 17, 1999 |
|
| Time |
Speaker |
Area |
| 6:30-8:00 |
BREAKFAST |
|
| 8:30-9:15 |
Ted Slaman, Berkeley |
applications
of recursion theoretic methods in set theory |
|
BREAK |
|
| 10:20-10:50 |
Alekos Kechris,
Cal Tech |
Borel equivalence
relations |
| 11:00-11:20 |
Marcia Groszek, Dartmouth |
independence
results (from ZFC) in recursion theory |
| 11:30-1:00 |
LUNCH |
|
| 1:30-2:15 |
Manny Lerman,
Connecticut |
lattice embeddings
into the computably enumerable degrees |
|
BREAK |
|
| 3:30-3:50 |
Andrea Sorbi, Siena |
enumeration
degrees |
| 4:00-4:20 |
Marat
Arslanov, Kazan |
d.c.e. and n-c.e.
degrees |
| 5:00-6:00 |
DINNER |
|
|
|
|
|
Friday, June 18, 1999
|
|
| 6:30-8:00 |
BREAKFAST |
|
|
DEPARTURE |
|