[Prev][Next][Index][Thread]

Feasible Math Workshop

Date:         Tue, 20 Jun 89 13:03:20 EDT

  The Feasible Mathematics Workshop will be held
at Cornell University, Mon. June 26-28, under the
auspices of the Mathematical Sciences Institute,
organized by Sam Buss and Phil Scott.  A tentative
schedule is given below.
   The "official motel" (= Collegetown Motor Lodge)
is now full, but an alternative motel,Best Western
(East Hill Plaza, Ithaca: 272-6100), has been recommended.
There are no registration fees, but you have to pay
some reasonable amount for banquet (to be determined).

                FEASIBLE WORKSHOP


Sun., 25 June:  Party at Anil Nerode's House (evening)

Mon., 26 June:  9:00 Introduction
                9:05-9:55  S. Cook
                10:10-11:00  Blum
                Coffee Break
                11:25-12:15  Gurevich
                  LUNCH
                2:00-2:50 Urquhart
                Coffee Break
                3:30-4:20 Crossley
                4:35--4:55 : Contributed Talks.

Tues 27 June:   9:05-9:55 Girard
                10:10-11:00 Scedrov
                 Coffee Break
                11:25-12:15 Nerode
                LUNCH
                 2:00-2:50 Leivant
                Coffee Break
                 3:30-4:20 Ko
                 4:35---  ???
TUESDAY NIGHT:  BANQUET

Wed, 28 June:   9:05-9:55 Buss
                10:10-11:00 Takeuti
                 Break
                11:25-12:15 Remmel
                2:00-2:50 Clote
                3:05-3:55 Ajtai

                      Feasible Math Workshop
                      TITLES: MAIN SPEAKERS


M.Ajtai: Parity & the Pigeonhole Principle

L. Blum - Computing Over the Reals (or an Arbitrary Ring)

S. Buss:  Feasible Theories of Arithmetic

P. Clote:  A First Order Theory for the Parallel Complexity Class NC

S. Cook: The Feasible Functionals of Finite Type (with B. Kapron)

J. Crossley: Polynomial-time Combinatorial Functions are Polynomials

J-Y Girard: Bounded Linear Logic I : A Modular Approach to Polynomial-
            Time Computability  (with A. Scedrov & P.J. Scott)

Y. Gurevich: On Finite Model Theory

K.-I. Ko - Computational Complexity of Roots of Real Functions

D. Leivant:  TBA

A. Nerode:  TBA

Jeff Remmel - Polynomially Graded Logic: A Graded Version of System T
              (with A. Nerode & A. Scedrov)

A. Scedrov:  Bounded Linear Logic II  (Cf. J.-Y Girard)

G. Takeuti - Bounded Arithmetic and the Polynomial Hierarchy

A. Urquhart - Functional Interpretations of Feasibly Constructive Arithmetic

   There will also be short contributed talks by Dekker,Ferriera, Foy, &
Kravicek.

    For more info, contact Sam Buss (sbuss@ucsd.edu, 619-534-6455) or
Phil Scott (scpsg@uottawa.bitnet , 613-564-6550) , or at MSI, Diana
Drake 607-255-7740 (local organizers).