Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Sieg Wilfried, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence 1990, xiv + 297 pp.Brown Douglas K.. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50.Hatzikiriakou Kostas and Simpson Stephen G.. WKL0 and orderings of countable abelian groups. Pp. 177–180.Hirst Jeffry L.. Marriage theorems and reverse mathematics. Pp. 181–196.Yu Xiaokang. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297.Ferreira Fernando. Polynomial time computable arithmetic. Pp. 137–156.Buchholz Wilfried and Sieg Wilfried. A note on polynomial time computable arithmetic. Pp. 51–55.Buss Samuel R.. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84.Takeuti Gaisi. Sharply bounded arithmetic and the function a – 1. Pp. 281–288.Clote Peter G.. A smash-based hierarchy between PTIME and PSPACE (preliminary version). Pp. 85–100.Feferman Solomon. Polymorphic typed lambda-calculi in a type-free axiomatic framework. Pp. 101–136Beeson Michael. Some theories conservative over intuitionistic arithmetic. Pp. 1–15.

Hudelmaier, Jörg

发现好书期刊，享受阅读乐趣