Program of Invited Talks, AMS Summer Research Conference
on Computability Theory and Applications
Sunday, June 13, 1999
Sergey Goncharov, Novosibirsk, Computable model theory
Julia Knight, Notre Dame, Models of arithmetic
Serikzhan Badaev, Almaty, Numeration theory
Jeffrey Remmel, San Diego, Computable algebra
Bakhadyr Khoussainov, Auckland, Issues in computable presentations of
models
Mikhail Peretyat 'kin, Almaty, Finitely axiomatizable theories and
Lindenbaum algebras
Monday, June 14, 1999
Peter Cholak, Notre Dame, The lattice of computably enumerable sets
Robert Soare, Chicago, The lattice of computably enumerable sets
Klaus Ambos-Spies, Heidelberg, Genericity and randomness
Barry Cooper, Leeds, Proof of the automorphism theorem, parts 1,2
Tuesday, June 15, 1999
Andre Nies, Chicago, Definability and coding
Richard Shore, Cornell, Natural definability in degree structures
Gerald Sacks, Harvard & MIT, Higher recursion theory
Wednesday, June 16, 1999
Stephen Simpson, Penn State, Reverse mathematics
Carl Jockusch, Urbana,
IT~
classes and computable combinatorics
C. T. Chong, Singapore, Reverse computability theory
Harvey Friedman, Ohio State, Reverse mathematics
Alexandra Shlapentokh, East Carolina, Issues related to Hilbert's Tenth
Problem
Anil Nerode, Cornell, Computable analysis and topology
Thursday, June 17, 1999
Theodore Slaman, Berkeley, Applications of recursion theoretic methods
in set theory
Marat Arslanov, Kazan, D.c.e. and n-c.e. degrees
Marcia Groszek, Dartmouth, Independence results (from ZFC) in recursion
theory
Manuel Lerman, Connecticut, Lattice embeddings into the computably
enumerable degrees
Andrea Sorbi, Siena, Enumeration degrees
xi
Previous Page Next Page