8:00 a.m. Scott fragments and computability. Jessica M Young*, Harvard
(983-03-1461)
8:30 a.m. Undecidability of Lattices of Ideals in $\mathcal{R}$. Russell G. Miller*, Cornell University
Andre O. Nies, University of Auckland
Richard A. Shore, Cornell University
(983-03-1405)
9:00 a.m. Enumerations and structures. S. S. Goncharov, Novosibirsk State University
V. S. Harizanov, George Washington University
J. F. Knight*, University of Notre Dame
C. McCoy, University of Notre Dame
R. G. Miller, Cornell University
D. R. Solomon, University of Notre Dame
(983-03-1189)
9:30 a.m. Minimal degrees which are $\Sigma_{2}^{0}$ but not $\Delta_{2}^{0}$. Richard A. Shore*, Cornell University
(983-03-967)
10:00 a.m. Computable choice sets for computable linear orderings. Manuel Lerman*, University of Connecticut at Storrs
Richard M Watnick, University of Connecticut
(983-03-721)
10:30 a.m. An extension of the recursively enumerable Turing degrees. Stephen G. Simpson*, Pennsylvania State University
(983-03-1213)
2:15 p.m. Algebraic and computability questions arising from fuzzy logics. Michael C. Laskowski*, University of Maryland
(983-03-1391)
2:45 p.m. The isomorphism problem for computable structures. Wesley C. Calvert*, University of Notre Dame
(983-03-915)
3:15 p.m. Differential Geometry and Computability Theory. Robert I. Soare*, University of Chicago
(983-03-1226)
3:45 p.m. Applications of Computability Theory to Differential Geometry. Barbara F. Csima*, University of Chicago
(983-03-1225)
4:15 p.m. Covering filters in the lattice of $\Pi^0_1$ classes. Douglas Cenzer, University of Florida
Farzan Riazati*, University of Wisconsin-Fond du Lac
(983-03-1063)
4:45 p.m. Effectiveness and infinite variable words. David Reed Solomon*, Notre Dame
Joe Miller, Indiana University-Bloomington
(983-03-1430)
5:15 p.m. Proof-theoretic strength of the stable marriage theorem. Douglas Cenzer*, University of Florida
Jeffrey Remmel, University of California San Diego
(983-03-1211)
5:45 p.m. Some Facts about Linear Orderings Provable in RT$^2_2$. Denis R. Hirschfeldt*, University of Chicago
Richard A. Shore, Cornell University
(983-03-1379)
8:00 a.m. A definiable yet non-$\Delta^0_3$ orbit in the computably emunerable sets. Peter A Cholak*, University of Notre Dame
Leo Harrington, Univerity of California -- Berkeley
(983-03-696)
8:30 a.m. A Concept of Computable Transformations for Locally Determined Logic Programs. Amy K. C. S. Vanderbilt*, Xavier University
(983-03-1394)
9:00 a.m. Structures Subject to Space Complexity. Zia Uddin*, University of Florida
(983-03-753)
9:30 a.m. Preparation and Normalization Theorems. Daniel J. Miller*, University of Wisconsin-Madison
(983-03-956)
10:00 a.m. Structural properties and principal filters of the lattice of Computably Enumerable Vector Spaces. Rumen D. Dimitrov*, The George Washington University
(983-03-687)
10:30 a.m. Interpolation Theorems for Recursive Quantum Functions in Computable Analysis. Iraj Kalantari*, Western Illinois University
Larry Welch, Western Illinois University
(983-03-125)
11:00 a.m. More Undecidable Lattices of Steinitz Exchange Systems. Lisa R. Galminas*, Northwestern State University of LA
John W. Rosenthal, Ithaca College
(983-03-1295)
11:30 a.m. Recursive content of higher order analysis. Anil Nerode*, Cornell University
(983-03-1233)