TY  - BOOK
AU  - Sieg,Wilfried
ED  - Workshop on Logic and Computation
TI  - Logic and computation: proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 
T2  - Contemporary mathematics, 
SN  - 9780821876947 (online)
AV  - QA9.59 .W67 1987
U1  - 511.3 20
PY  - 1990///
CY  - Providence, R.I.
PB  - American Mathematical Society
KW  - Computable functions
KW  - Data processing
KW  - Congresses
N1  - "The Workshop on Logic and Computation was held at Carnegie Mellon University on June 30-July 2, 1987"--T.p. verso; Includes bibliographical references; Some theories conservative over intuitionistic arithmetic; Michael Beeson --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057812; Ramsey interpreted: a parametric version of Ramsey's theorem; Gianluigi Bellin --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057813; Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic; Douglas K. Brown --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057814; A note on polynomial time computable arithmetic; Wilfried Buchholz and Wilfried Sieg --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057815; Axiomatizations and conservation results for fragments of bounded arithmetic; Samuel R. Buss --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057816; A smash-based hierarchy between PTIME and PSPACE (preliminary version); Peter G. Clote --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057817; Polymorphic typed lambda-calculi in a type-free axiomatic framework; Solomon Feferman --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057818; Polynomial time computable arithmetic; Fernando Ferreira --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057819; Metaprogramming in SIL; Chris Goad --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/09; ${\rm WKL}_0$ and orderings of countable abelian groups; Kostas Hatzikiriakou and Stephen G. Simpson --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057821; Marriage theorems and reverse mathematics; Jeffry L. Hirst --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057822; Computationally based set existence principles; Daniel Leivant --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057823; Hierarchy results for mixed-time; Ken McAloon --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057824; Polynomial time equivalence types; A. Nerode and J. B. Remmel --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057825; Program development through proof transformation; Frank Pfenning --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057826; Some models of Scott's theory ${\rm LCF}$ based on a notion of rate of convergence; Rick Statman --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057827; Sharply bounded arithmetic and the function $a \stackrel {.}{-} 1$; Gaisi Takeuti --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057828; Radon-Nikod�ym theorem is equivalent to arithmetical comprehension; Xiaokang Yu --; http://www.ams.org/conm/106; http://dx.doi.org/10.1090/conm/106/1057829; Access is restricted to licensed institutions; Electronic reproduction; Providence, Rhode Island; American Mathematical Society; 2012
UR  - http://www.ams.org/conm/106/
UR  - http://dx.doi.org/10.1090/conm/106
ER  -