2 results
Jean Goubault-Larrecq and Ian Mackie. Proof theory and automated deduction. Applied logic series, vol. 6. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1997, xv + 424 pp.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 6 / Issue 1 / March 2000
- Published online by Cambridge University Press:
- 15 January 2014, pp. 94-95
- Print publication:
- March 2000
-
- Article
- Export citation
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 281–288. - Peter G. Clote. A smash-based hierarchy between PTIME and PSPACE (preliminary version). Pp. 85–100. - Solomon Feferman. Polymorphic typed lambda-calculi in a type-free axiomatic framework. Pp. 101–136 - Michael Beeson. Some theories conservative over intuitionistic arithmetic. Pp. 1–15.
-
- Journal:
- The Journal of Symbolic Logic / Volume 61 / Issue 2 / June 1996
- Published online by Cambridge University Press:
- 12 March 2014, pp. 697-699
- Print publication:
- June 1996
-
- Article
- Export citation