IMSc Library catalog › Details for: Logic and computation :

Normal view MARC view ISBD view

Logic and computation : [electronic resource] proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 / Wilfried Sieg, editor.

By: Workshop on Logic and Computation (1987 : Carnegie Mellon University)Contributor(s): Sieg, Wilfried, 1945-Material type: Text

TextSeries: Contemporary mathematics (American Mathematical Society) ; v. 106.Publication details: Providence, R.I. : American Mathematical Society, c1990Description: 1 online resource (xiv, 297 p. : ill.)ISBN: 9780821876947 (online)Subject(s): Computable functions -- Data processing -- CongressesAdditional physical formats: Logic and computation :DDC classification: 511.3 LOC classification: QA9.59 | .W67 1987Online resources: Contents | Contents

Contents:

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

Item type:

E-BOOKS

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 43 )
Comments ( 0 )

Current library	Home library	Call number	Materials specified	URL	Status	Date due	Barcode
IMSc Library	IMSc Library			Link to resource	Available		EBK11386

"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 -- Ramsey interpreted: a parametric version of Ramsey's theorem / Gianluigi Bellin -- Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic / Douglas K. Brown -- A note on polynomial time computable arithmetic / Wilfried Buchholz and Wilfried Sieg -- Axiomatizations and conservation results for fragments of bounded arithmetic / Samuel R. Buss -- A smash-based hierarchy between PTIME and PSPACE (preliminary version) / Peter G. Clote -- Polymorphic typed lambda-calculi in a type-free axiomatic framework / Solomon Feferman -- Polynomial time computable arithmetic / Fernando Ferreira -- Metaprogramming in SIL / Chris Goad -- ${\rm WKL}_0$ and orderings of countable abelian groups / Kostas Hatzikiriakou and Stephen G. Simpson -- Marriage theorems and reverse mathematics / Jeffry L. Hirst -- Computationally based set existence principles / Daniel Leivant -- Hierarchy results for mixed-time / Ken McAloon -- Polynomial time equivalence types / A. Nerode and J. B. Remmel -- Program development through proof transformation / Frank Pfenning -- Some models of Scott's theory ${\rm LCF}$ based on a notion of rate of convergence / Rick Statman -- Sharply bounded arithmetic and the function $a \stackrel {.}{-} 1$ / Gaisi Takeuti -- Radon-Nikod�ym theorem is equivalent to arithmetical comprehension / Xiaokang Yu --