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
$WKL_0$ 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 $LCF$ based on a notion of rate of convergence
Sharply bounded arithmetic and the function $a\dot-1$
Theorem is equivalent to arithmetical comprehension
Table of Contents provided by Publisher. All Rights Reserved.
What is included with this book?
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.
Please wait while the item is added to your bag...