American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:09:57


Program  |  Deadlines  |  Registration/Housing/Etc.  |  Inquiries:  meet@ams.org

1999 Spring Southeastern Section Meeting
Gainesville, FL, March 12-13, 1999
Meeting #940

Associate secretaries:
Robert J Daverman, AMS daverman@math.utk.edu

Special Session on Computability Theory

  • Friday March 12, 1999, 9:00 a.m.-10:50 a.m.
    Special Session on Computability Theory, I

    Room 217, W. W. Little Hall
    Organizers:
    Douglas Cenzer, University of Florida cenzer@math.ufl.edu
    Geoffrey Louis LaForte, University of West Florida glaforte@coginst.uwf.edu
    Rick L. Smith, University of Florida rs@math.ufl.edu

    • 9:00 a.m.
      Nonlow$_{2}$ r.e. degrees with the properties of low$_{2}$ degrees.
      Richard A. Shore*, Cornell University
      (940-03-179)
    • 10:00 a.m.
      A set with minimal wtt-degree and c.e. Turing degree .
      Reed Solomon*, University of Wisconsin, Madison
      Rod Downey, Victoria University
      (940-03-246)
    • 10:30 a.m.
      Every set has a least jump enumeration.
      Richard J Coles*, University of Auckland
      Rod G Downey, Victoria University of Wellington
      Theodore A Slaman, University of California, Berkeley
      (940-03-189)
  • Friday March 12, 1999, 2:30 p.m.-5:50 p.m.
    Special Session on Computability Theory, II

    Room 217, W. W. Little Hall
    Organizers:
    Douglas Cenzer, University of Florida cenzer@math.ufl.edu
    Geoffrey Louis LaForte, University of West Florida glaforte@coginst.uwf.edu
    Rick L. Smith, University of Florida rs@math.ufl.edu

    • 2:30 p.m.
      Automorphisms of the Lattice of $\Pi_1^0$ Classes.
      Rod Downey*, Victoria University of Wellington
      (940-03-176)
    • 3:00 p.m.
      Automorphisms of the computably enumerable sets.
      Kevin Wald*, University of Chicago
      (940-03-312)
    • 3:30 p.m.
      Relativizations of certain concepts in computability theory.
      Stephen M Walk*, University of Notre Dame
      (940-03-335)
    • 4:00 p.m.
      The Complexity of Extensions of a Nonmonotonic Theory.
      Amy K. C. S. Vanderbilt*, University of Florida
      (940-03-274)
    • 4:30 p.m.
      Some recent results on the lattice of Pi-0-1 classes.
      Farzan Riazati*, University of FLorida
      (940-03-342)
    • 5:00 p.m.
      Computability Theory of Generalized Functions.
      Klaus Weihrauch, Fern University
      Ning Zhong*, University of Cincinnati
      (940-03-139)
    • 5:30 p.m.
      Some open problems in computable analysis.
      Marian B. Pour-El*, University of Minnesota
      (940-03-263)
  • Saturday March 13, 1999, 8:30 a.m.-10:50 a.m.
    Special Session on Computability Theory, III

    Room 217, W. W. Little Hall
    Organizers:
    Douglas Cenzer, University of Florida cenzer@math.ufl.edu
    Geoffrey Louis LaForte, University of West Florida glaforte@coginst.uwf.edu
    Rick L. Smith, University of Florida rs@math.ufl.edu

    • 8:30 a.m.
      On the lattice of c.e. subalgebras of a computable Boolean algebra.
      Jeffrey B. Remmel*, University of California, San Diego
      Jinghui Yang, Qualcomm
      (940-03-286)
    • 9:00 a.m.
      $\Delta_{2}^{0}$-categorical linear orderings and Boolean algebras.
      Charles F. McCoy*, University of Notre Dame
      (940-03-227)
    • 9:30 a.m.
      The $\Delta^0_2$-Spectrum of a Linear Order.
      Russell G. Miller*, University of Chicago
      (940-03-146)
    • 10:00 a.m.
      Degree Spectra of Relations on Algebraic Structures.
      Denis R. Hirschfeldt*, Department of Mathematics, Cornell University
      (940-03-235)
    • 10:30 a.m.
      Ramsey's theorem for computably enumerable partitions.
      Tamara J. Hummel*, Allegheny College
      Carl G. Jockusch, Jr., University of Illinois
      (940-03-222)
  • Saturday March 13, 1999, 2:30 p.m.-5:50 p.m.
    Special Session on Computability Theory, IV

    Room 217, W. W. Little Hall
    Organizers:
    Douglas Cenzer, University of Florida cenzer@math.ufl.edu
    Geoffrey Louis LaForte, University of West Florida glaforte@coginst.uwf.edu
    Rick L. Smith, University of Florida rs@math.ufl.edu

    • 2:30 p.m.
      Minimality questions and completions of PA.
      Julia F. Knight*, University of Notre Dame
      (940-03-103)
    • 3:00 p.m.
      Effective Robinson Forcing.
      Walker M. White*, Cornell University
      (940-03-247)
    • 3:30 p.m.
      Relative Computability of Models and Enumerations.
      Alex M McAllister*, Dartmouth College
      (940-03-277)
    • 4:00 p.m.
      Computably enumerable relations on computable structures.
      Valentina S Harizanov*, The George Washington University
      (940-03-259)
    • 4:30 p.m.
      On Automata Presentable Structures.
      Bakhadyr M Khoussainov*, The University of Auckland
      Sasha Rubin, The University of Auckland
      (940-03-119)
    • 5:00 p.m.
      Generalized Weak Presentations.
      Alexandra Shlapentokh*, East Carolina University, Greenville, NC 27858
      (940-03-193)
    • 5:30 p.m.
      Reflection Principles and Constructive Large Cardinals.
      Edward R. Griffor*, CAI
      (940-03-271)
Inquiries:  meet@ams.org


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia