8:00 a.m. Permitting, forcing and copies of recursive structures. Christopher John Ash, Monash University, Australia
Peter A. Cholak*, University of Notre Dame
Julia Knight, University of Notre Dame
(908-03-109)
8:30 a.m. Turing degrees of certain isomorphic images of recursive relations. Valentina S. Harizanov*, George Washington University
(908-03-626)
9:00 a.m. Complexity and real computation. Lenore Blum*, University of California, Berkeley
(908-03-547)
9:30 a.m. On the computability of fractal dimensions and Hausdorff measure. Ker-I Ko*, State University of New York, Stony Brook
(908-68-106)
10:00 a.m. Recursive approximation in point-free topological spaces and nonextendible functions. Iraj Kalantari*, Western Illinois University
(908-03-631)
10:30 a.m. Index sets for $\Pi^0_1$ classes. Douglas Cenzer*, University of Florida
Jeffrey B. Remmel, University of California at San Diego, La Jolla
(908-03-381)
2:30 p.m. Computably categorical structures and the degree spectra of relations. Richard A. Shore*, Cornell University
(908-03-453)
3:00 p.m. Reductibilities and dimensions of recursive structures. Bakhadyr Khoussainov*, Cornell University
(908-03-386)
3:30 p.m. Low$_n$ Boolean algebras and the search for recursive copies. John J. Thurber*, Eastern Oregon State College
(908-03-615)
4:00 p.m. $\Sigma_2$-constructions and $I\Sigma_1$. Marcia J. Groszek, Dartmouth College
Tamara J. Hummel*, Allegheny College
(908-03-265)
4:30 p.m. Partitions of Euclidean space. James H. Schmerl*, University of Connecticut, Storrs
(908-03-408)
5:00 p.m. On the semilattice of $NP$ substructures of a polynomial time structure. Anil Nerode*, Cornell University
Jeffrey B. Remmel, University of California at San Diego, La Jolla
(908-03-657)
8:30 a.m. On the complexity of finding the obstruction set. William Gasarch*, University of Maryland, College Park
(908-03-162)
9:00 a.m. Feasible graphs with standard universe. Douglas Cenzer, University of Florida
Jeffrey B. Remmel*, University of California at San Diego, La Jolla
(908-03-382)
9:30 a.m. Difference sets and computability. Rodney G. Downey, Victoria University, New Zealand
Zoltan Furedi, University of Illinois, Urbana-Champaign
Carl G. Jockusch, Jr.*, University of Illinois, Urbana-Champaign
Lee A. Rubel, University of Illinois, Urbana-Champaign
(908-03-517)
10:00 a.m. On a question of Los. Theodore A. Slaman*, University of Chicago
W. Hugh Woodin, University of California, Berkeley
(908-03-656)
10:30 a.m. Approximate inference with generic oracles. Douglas Cenzer, University of Florida
William R. Moser*, University of Florida
(908-03-446)
11:00 a.m. Proof theoretic large cardinals. Edward R. Griffor*, Uppsala University, Sweden
(908-03-484)