8:00 a.m. Invariance and Noninvariance in the Lattice of $\Pi_1^0$ Classes. Peter A Cholak, University of Notre Dame
Rod G Downey*, Victoria University, NZ
(973-03-945)
8:30 a.m. A Decision Procedure for the $AE$-theory of the Lattice of $\Pi^0_1$ Classes. Linda Lawton*, Western Illinois University
(973-03-1208)
9:00 a.m. Definability and structural properties for the lattice of $Pi^0_1$--classes. Andr\'e Nies*, University of Chicago
(973-03-1385)
9:30 a.m. The Lattice of $\Pi^0_1$ Classes. Douglas Cenzer, University of Florida
Farzan Riazati*, Savannah College of Art and Design
(973-03-742)
10:00 a.m. Medevev degrees of $\Pi^0_1$ classes are dense. Douglas A Cenzer, University of Florida
Peter G Hinman*, University of Michigan
(973-03-821)
10:30 a.m. Computability of the Common Derivation in Locally Determined Logic Programs. Amy K. C. S. Vanderbilt*, Xavier University
(973-03-929)
2:15 p.m. Computable models, invariants and numberings. Serguei S Goncharov*, Novosibirsk State University, Novosibirsk, Russia
(973-03-960)
2:45 p.m. Isomorphism problems and computable classification. Sergey S Goncharov, Novosibirsk State University
Julia F Knight*, University of Notre Dame
(973-03-534)
3:15 p.m. Complexity of Diagrams of Countable Structures. Valentina S Harizanov*, George Washington University
Julia F Knight, University of Notre Dame
Andrei S Morozov, Sobolev Institute of Mathematics
(973-03-1248)
3:45 p.m. Computably Categorical Trees of Finite Height I. Steffen Lempp, University of Wisconsin-Madison
Charles McCoy, University of Wisconsin-Madison
Russell Miller*, Cornell University
Reed Solomon, University of Wisconsin-Madison
(973-03-1257)
4:15 p.m. Computably Categorical Trees of Finite Height II. Steffen Lempp, University of Wisconsin, Madison
Charles McCoy*, University of Wisconsin, Madison
Russell Miller, Cornell University
Reed Solomon, University of Wisconsin, Madison
(973-03-1189)
4:45 p.m. Computable choice functions for computable linear orderings. Manuel Lerman*, University of Connecticut, Storrs
Richard M Watnick, University of Connecticut, Stamford
(973-03-355)
5:15 p.m. Degree Spectra of Prime Models. Barbara F. Csima*, University of Chicago
(973-03-1054)
5:45 p.m. Computability, Differential Geometry, and Model Theory. Robert I Soare*, University of Chicago
Barbara F. Csima, University of Chicago
(973-03-1300)
8:00 a.m. Logical Aspects of Ramsey's Theorem. Theodore A. Slaman*, University of California, Berkeley
(973-03-1325)
8:30 a.m. The $\forall\exists$-Theory of $\mathcal{R}(\leq,\vee,\wedge)$ is Undecidable. Russell G. Miller, Cornell University
Andre O. Nies, University of Chicago
Richard A. Shore*, Cornell University
(973-03-1115)
9:00 a.m. A definiable yet non-$\Delta^0_3$ orbit in the computably emunerable sets. Peter A Cholak*, University of Notre Dame
A Harrington, UC-- Berkeley
(973-03-879)
9:30 a.m. Lattice embeddings in the computably enumerable degrees. Steffen Lempp, University of Wisconsin-Madison
Manuel Lerman, University of Connecticut
Reed Solomon*, University of Wisconsin-Madison
(973-03-1061)
10:00 a.m. The computational complexity of uncountably categorical models. Steffen Lempp*, University of Wisconsin-Madison
(973-03-894)
10:30 a.m. Relative 1-Randomness of Reals. Rod G. Downey, School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand
Denis R. Hirschfeldt*, Department of Mathematics, University of Chicago
Andr\'e Nies, Department of Mathematics, University of Chicago
Frank Stephan, Workgroup Mathematical Logic and Theoretical Computer Science, Mathematical Institute, University of Heidelberg
(973-03-1383)
11:00 a.m. A blend of methods of recursion theory and analysis. Iraj Kalantari*, Western Illinois University
(973-03-1111)
11:30 a.m. Recursive Content of Abstract Functional Analysis. Anil Nerode*, Cornell University
Joe Miller, Cornell University
(973-03-1052)