AMS Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:26
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
1996 Joint Mathematics Meetings
Orlando, FL, January 1013, 1996
Meeting #908
Associate secretaries:
Lance W Small, AMS lwsmall@ucsd.edu
Donovan H Van Osdol, MAA dv@christa.unh.edu
AMS Special Session on Recursive and Feasible Mathematics

Wednesday January 10, 1996, 8:00 a.m.10:50 a.m.
AMS Special Session on Recursive and Feasible Mathematics, I
Organizers:
Douglas Cenzer, University of Florida
Jeffrey B. Remmel, University of California at San Diego, La Jolla

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
(90803109)

8:30 a.m.
Turing degrees of certain isomorphic images of recursive relations.
Valentina S. Harizanov*, George Washington University
(90803626)

9:00 a.m.
Complexity and real computation.
Lenore Blum*, University of California, Berkeley
(90803547)

9:30 a.m.
On the computability of fractal dimensions and Hausdorff measure.
KerI Ko*, State University of New York, Stony Brook
(90868106)

10:00 a.m.
Recursive approximation in pointfree topological spaces and nonextendible functions.
Iraj Kalantari*, Western Illinois University
(90803631)

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
(90803381)

Wednesday January 10, 1996, 2:30 p.m.5:20 p.m.
AMS Special Session on Recursive and Feasible Mathematics, II
Organizers:
Douglas Cenzer, University of Florida
Jeffrey B. Remmel, University of California at San Diego

2:30 p.m.
Computably categorical structures and the degree spectra of relations.
Richard A. Shore*, Cornell University
(90803453)

3:00 p.m.
Reductibilities and dimensions of recursive structures.
Bakhadyr Khoussainov*, Cornell University
(90803386)

3:30 p.m.
Low$_n$ Boolean algebras and the search for recursive copies.
John J. Thurber*, Eastern Oregon State College
(90803615)

4:00 p.m.
$\Sigma_2$constructions and $I\Sigma_1$.
Marcia J. Groszek, Dartmouth College
Tamara J. Hummel*, Allegheny College
(90803265)

4:30 p.m.
Partitions of Euclidean space.
James H. Schmerl*, University of Connecticut, Storrs
(90803408)

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
(90803657)

Thursday January 11, 1996, 8:30 a.m.11:20 a.m.
AMS Special Session on Recursive and Feasible Mathematics, III
Organizers:
Douglas Cenzer, University of Florida
Jeffrey B. Remmel, University of California at San Diego

8:30 a.m.
On the complexity of finding the obstruction set.
William Gasarch*, University of Maryland, College Park
(90803162)

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
(90803382)

9:30 a.m.
Difference sets and computability.
Rodney G. Downey, Victoria University, New Zealand
Zoltan Furedi, University of Illinois, UrbanaChampaign
Carl G. Jockusch, Jr.*, University of Illinois, UrbanaChampaign
Lee A. Rubel, University of Illinois, UrbanaChampaign
(90803517)

10:00 a.m.
On a question of Los.
Theodore A. Slaman*, University of Chicago
W. Hugh Woodin, University of California, Berkeley
(90803656)

10:30 a.m.
Approximate inference with generic oracles.
Douglas Cenzer, University of Florida
William R. Moser*, University of Florida
(90803446)

11:00 a.m.
Proof theoretic large cardinals.
Edward R. Griffor*, Uppsala University, Sweden
(90803484)
Inquiries: meet@ams.org