Today, November 30^{th}, is AMS Day! Join our celebration of AMS members and explore special offers on AMS publications, membership and more. Offers end 11:59pm EST.
2:00 p.m. Limit sets and the complexity of quantifier elimination for Pfaffian expressions. Andrei Gabrielov*, Purdue University
(980-03-94)
2:30 p.m. A Normalization Algorithm. Daniel J. Miller*, University of Wisconsin - Madison
(980-03-272)
3:00 p.m. Effective Completeness Theorems for Modal Logics. Suman Ganguli*, University of Michigan
Anil Nerode, Cornell University
(980-03-182)
3:30 p.m. Principal Filters of the Lattice of Computably Enumerable Vector Spaces. Valentina S. Harizanov*, The George Washington University
(980-03-82)
4:00 p.m. The Computational Complexity of Computable Saturation. Walker M. White*, University of Dallas
(980-03-313)
3:00 p.m. Complicated relations on computable structures. S. S. Goncharov, Novosibirsk State University
V. S. Harizanov, George Washington University
J. F. Knight*, University of Notre Dame
R. A. Shore, Cornell University
(980-03-183)
3:30 p.m. Asymptotic theories of differential fields. Zo\'e M Chatzidakis*, CNRS - Universite Paris 7
(980-03-278)