AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Logic and Computation
About this Title
Wilfried Sieg, Editor
Publication: Contemporary Mathematics
Publication Year:
1990; Volume 106
ISBNs: 978-0-8218-5110-4 (print); 978-0-8218-7694-7 (online)
DOI: https://doi.org/10.1090/conm/106
MathSciNet review: 1057811
Table of Contents
Download chapters as PDF
Front/Back Matter
Articles
- Michael Beeson – Some theories conservative over intuitionistic arithmetic [MR 1057812]
- Gianluigi Bellin – Ramsey interpreted: a parametric version of Ramsey’s theorem [MR 1057813]
- Douglas K. Brown – Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic [MR 1057814]
- Wilfried Buchholz and Wilfried Sieg – A note on polynomial time computable arithmetic [MR 1057815]
- Samuel R. Buss – Axiomatizations and conservation results for fragments of bounded arithmetic [MR 1057816]
- Peter G. Clote – A smash-based hierarchy between PTIME and PSPACE (preliminary version) [MR 1057817]
- Solomon Feferman – Polymorphic typed lambda-calculi in a type-free axiomatic framework [MR 1057818]
- Fernando Ferreira – Polynomial time computable arithmetic [MR 1057819]
- Chris Goad – Metaprogramming in SIL
- Kostas Hatzikiriakou and Stephen G. Simpson – $\textrm {WKL}_0$ and orderings of countable abelian groups [MR 1057821]
- Jeffry L. Hirst – Marriage theorems and reverse mathematics [MR 1057822]
- Daniel Leivant – Computationally based set existence principles [MR 1057823]
- Ken McAloon – Hierarchy results for mixed-time [MR 1057824]
- A. Nerode and J. B. Remmel – Polynomial time equivalence types [MR 1057825]
- Frank Pfenning – Program development through proof transformation [MR 1057826]
- Rick Statman – Some models of Scott’s theory $\textrm {LCF}$ based on a notion of rate of convergence [MR 1057827]
- Gaisi Takeuti – Sharply bounded arithmetic and the function $a \stackrel {.}{-} 1$ [MR 1057828]
- Xiaokang Yu – Radon-Nikodým theorem is equivalent to arithmetical comprehension [MR 1057829]