|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910826115703321 |
|
|
Titolo |
Logic and computation : proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 / / Wilfried Sieg, editor |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Providence, Rhode Island : , : American Mathematical Society, , [1990] |
|
©1990 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (314 p.) |
|
|
|
|
|
|
Collana |
|
Contemporary mathematics, , 0271-4132 ; ; 106 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computable functions - Data processing |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
"The Workshop on Logic and Computation was held at Carnegie Mellon University on June 30-July 2, 1987"--T.p. verso. |
|
|
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
Contents -- Preface -- 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 second order arithmetic -- A note on polynomial time computable arithmetic -- Axiomatizations and conservation results for fragments of bounded arithmetic -- A smash-based hierarchy between PTIME and PSPACE -- Polymorphic typed lambda-calculi in a type-free axiomatic framework -- Polynomial time computable arithmetic -- Metaprogramming in SIL -- W K Lo and orderings of countable abelian groups -- Marriage theorems and reverse mathematics -- Computationally based set existence principles -- Hierarchy results for mixed-time -- Polynomial time equivalence types -- Program development through proof transformation -- Some models of Scott's theory LC F based on a notion of rate of convergence -- Sharply bounded arithmetic and the function a -1 -- Radon-nikodym theorem is equivalent to arithmetical comprehension. |
|
|
|
|
|
|
|