American Mathematical Society

AMS Sectional Meeting AMS Special Session

Current as of Saturday, April 13, 2013 00:24:55

Associate secretaries:

Steven H. Weintraub, AMS shw2@lehigh.edu

Sunday April 7, 2013, 9:30 a.m.-10:45 a.m.
Special Session on Recursion and Definability, I
Room 423, Fulton Hall
Organizers:
Rachel Epstein, Harvard University
Karen Lange, Wellesley College Karen.Lange@wellesley.edu
Russell Miller, Queens College and City University of New York Graduate Center
- 9:30 a.m.
  Using complete sets to distinguish reducibilities.
  Brooke M Andersen*, Assumption College
  (1088-03-220)
- 10:00 a.m.
  Some undecidable problems.
  Bjorn Poonen*, Massachusetts Institute of Technology
  (1088-00-206)

Sunday April 7, 2013, 3:00 p.m.-5:20 p.m.
Special Session on Recursion and Definability, II
Room 423, Fulton Hall
Organizers:
Rachel Epstein, Harvard University
Karen Lange, Wellesley College Karen.Lange@wellesley.edu
Russell Miller, Queens College and City University of New York Graduate Center
- 3:00 p.m.
  The Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength.
  Antonio Montalbán, Department of Mathematics, University of California, Berkeley
  Richard A. Shore*, Department of Mathematics, Cornell University
  (1088-03-81)
- 4:00 p.m.
  Weak {D}emuth randomness and computational strength.
  Johanna N.Y. Franklin*, University of Connecticut
  Keng Meng Ng, Nanyang Technological University
  (1088-03-263)
- 4:30 p.m.
  A Random Walk Through Zero-One Laws for Classes of Graphs with a Forbidden Subgraph.
  Rehana Patel*, Olin College of Engineering
  (1088-03-238)
- 5:00 p.m.
  Computability of 0-1 Laws.
  Nathanael Ackerman*, Harvard University
  (1088-03-132)