Logic and Computation.

Intro -- 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.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.