Logic and Computation.
Sieg, Wilfried.
Logic and Computation. - 1st ed. - 1 online resource (314 pages) - Contemporary Mathematics ; v.106 . - Contemporary Mathematics .
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.
9780821876947
Computable functions -- Data processing -- Congresses.
Electronic books.
QA9.59 -- .W67 1987eb
511.3
Logic and Computation. - 1st ed. - 1 online resource (314 pages) - Contemporary Mathematics ; v.106 . - Contemporary Mathematics .
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.
9780821876947
Computable functions -- Data processing -- Congresses.
Electronic books.
QA9.59 -- .W67 1987eb
511.3