| 000 -LEADER |
|---|
| fixed length control field |
02226nmm a2200181Ia 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230306s9999||||xx |||||||||||||||||und|| |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780821876947 (online) |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Logic and computation : |
| Remainder of title |
proceedings of a workshop held at Carnegie Mellon University, June 30July 2, 1987 |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Providence, R.I. : |
| Name of publisher, distributor, etc. |
American Mathematical Society, |
| Date of publication, distribution, etc. |
c1990 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource (xiv, 297 p. : ill.) |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Contemporary mathematics |
| Volume/sequential designation |
v. 106 |
| International Standard Serial Number |
10983627 |
| 500 ## - GENERAL NOTE |
|---|
| General note |
The Workshop on Logic and Computation was held at Carnegie Mellon University on June 30July 2, 1987T.p. verso. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
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 |
| Formatted contents note |
\stackrel . 1 |
| -- |
; RadonNikodym theorem is equivalent to arithmetical comprehension |
| Statement of responsibility |
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 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computable functions |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Sieg Wilfried |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="http://www.ams.org/conm/106/">http://www.ams.org/conm/106/</a> |
