The Workshop on Logic and Computation was held at Carnegie Mellon University on June 30July 2, 1987T.p. verso.

Includes bibliographical references.

Some theories conservative over intuitionistic arithmetic ; Ramsey interpreted: a parametric version of Ramsey's theorem ; Notions of closed subsets of a complete separable metric space in weak subsystems of secondorder arithmetic ; A note on polynomial time computable arithmetic ; Axiomatizations and conservation results for fragments of bounded arithmetic ; A smashbased hierarchy between PTIME and PSPACE (preliminary version) ; Polymorphic typed lambdacalculi in a typefree axiomatic framework ; Polynomial time computable arithmetic ; Metaprogramming in SIL ; rm WKL_0 and orderings of countable abelian groups ; Marriage theorems and reverse mathematics ; Computationally based set existence principles ; Hierarchy results for mixedtime ; Polynomial time equivalence types ; Program development through proof transformation ; Some models of Scott's theory rm LCF based on a notion of rate of convergence ; Sharply bounded arithmetic and the function \stackrel . 1 ; RadonNikodym theorem is equivalent to arithmetical comprehension Michael Beeson ; Gianluigi Bellin ; Douglas K Brown ; Wilfried Buchholz and Wilfried Sieg ; Samuel R Buss ; Peter G Clote ; Solomon Feferman ; Fernando Ferreira ; Chris Goad ; Kostas Hatzikiriakou and Stephen G Simpson ; Jeffry L Hirst ; Daniel Leivant ; Ken McAloon ; A Nerode and J B Remmel ; Frank Pfenning ; Rick Statman ; Gaisi Takeuti ; Xiaokang Yu