AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:10:44
2002 Fall Central Section Meeting
Madison, WI, October 1213, 2002
Meeting #980
Associate secretaries: Susan J Friedlander, AMS susan@math.northwestern.edu
Special Session on Effectiveness Questions in Model Theory

Saturday October 12, 2002, 9:00 a.m.11:20 a.m.
Special Session on Effectiveness Questions in Model Theory, I
Room B203, Van Vleck Hall
Organizers:
Charles McCoy, University of WisconsinMadison mccoy@math.wisc.edu
Reed Solomon, University of WisconsinMadison rsolomon@math.wisc.edu
Patrick Speissegger, University of WisconsinMadison speisseg@math.wisc.edu

9:00 a.m.
Effectiveness questions in arithmetic.
Andrew P Arana*, Stanford University
(98003252) 
9:30 a.m.
$\Delta^0_2$categoricity in Abelian pgroups.
Douglas Cenzer*, University of Florida
(98003215) 
10:00 a.m.
Discussion 
10:30 a.m.
Bounding prime, homogeneous, and saturated models.
Barbara F. Csima*, University of Chicago
(98003240) 
11:00 a.m.
Bounding prime, homogeneous, and saturated models {II}.
Denis R. Hirschfeldt*, University of Chicago
(98003267)

9:00 a.m.

Saturday October 12, 2002, 2:00 p.m.4:50 p.m.
Special Session on Effectiveness Questions in Model Theory, II
Room B203, Van Vleck Hall
Organizers:
Charles McCoy, University of WisconsinMadison mccoy@math.wisc.edu
Reed Solomon, University of WisconsinMadison rsolomon@math.wisc.edu
Patrick Speissegger, University of WisconsinMadison speisseg@math.wisc.edu

2:00 p.m.
Limit sets and the complexity of quantifier elimination for Pfaffian expressions.
Andrei Gabrielov*, Purdue University
(9800394) 
2:30 p.m.
A Normalization Algorithm.
Daniel J. Miller*, University of Wisconsin  Madison
(98003272) 
3:00 p.m.
Effective Completeness Theorems for Modal Logics.
Suman Ganguli*, University of Michigan
Anil Nerode, Cornell University
(98003182) 
3:30 p.m.
Principal Filters of the Lattice of Computably Enumerable Vector Spaces.
Valentina S. Harizanov*, The George Washington University
(9800382) 
4:00 p.m.
The Computational Complexity of Computable Saturation.
Walker M. White*, University of Dallas
(98003313) 
4:30 p.m.
Discussion

2:00 p.m.

Sunday October 13, 2002, 9:30 a.m.11:20 a.m.
Special Session on Effectiveness Questions in Model Theory, III
Room B203, Van Vleck Hall
Organizers:
Charles McCoy, University of WisconsinMadison mccoy@math.wisc.edu
Reed Solomon, University of WisconsinMadison rsolomon@math.wisc.edu
Patrick Speissegger, University of WisconsinMadison speisseg@math.wisc.edu

9:30 a.m.
Extracting syntactic proofs from modeltheoretic arguments.
Jeremy Avigad*, Carnegie Mellon University
(98003157) 
10:00 a.m.
A positive perspective on computable analysis.
Joseph S. Miller*, Indiana University
(98003295) 
10:30 a.m.
A model completeness result arising from recursive model theory.
Michael C. Laskowski*, University of Maryland
(98003271) 
11:00 a.m.
On decidable prime models.
Jessica Millar Young*, Harvard
(98003280)

9:30 a.m.

Sunday October 13, 2002, 3:00 p.m.4:20 p.m.
Special Session on Effectiveness Questions in Model Theory, IV
Room B203, Van Vleck Hall
Organizers:
Charles McCoy, University of WisconsinMadison mccoy@math.wisc.edu
Reed Solomon, University of WisconsinMadison rsolomon@math.wisc.edu
Patrick Speissegger, University of WisconsinMadison speisseg@math.wisc.edu

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
(98003183) 
3:30 p.m.
Asymptotic theories of differential fields.
Zo\'e M Chatzidakis*, CNRS  Universite Paris 7
(98003278) 
4:00 p.m.
Discussion

3:00 p.m.