No CrossRef data available.
Article contents
Reasoning in simple type theory – Festschrift in honor of Peter B. Andrews on his 70th birthday, edited by Christoph Benzmüller, Chad E. Brown, Jörg Siekmann, and Richard Statman, Studies in Logic, vol. 17. College Publications, London, 2008, 454 pp.
Published online by Cambridge University Press: 15 January 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2010
References
Benzmüller, Christoph, Brown, Chad E., and Kohlhase, Michael. Cut elimination with ξ-functionality. Pp. 84–100.Google Scholar
Hermant, Olivier and Lipton, James. Cut elimination in the intuitionistic theory of types with axioms and rewriting cuts, constructively. Pp. 101–134.Google Scholar
Kaminski, Mark and Smolka, Gert. A finite axiomatization of propositional type theory in pure lambda calculus. Pp. 228–243.Google Scholar
Dowek, Gilles. Skolemization in simple type theory: the logical and the theoretical points of view. Pp. 244–255.Google Scholar
Gabbay, Murdoch J. and Mathijssen, Aad. The lambda-calculus is nominal algebraic. Pp. 256–287.Google Scholar
Pfenning, Frank. Church and Curry: Combining intrinsic and extrinsic typing. Pp. 288–323.Google Scholar
Kirchner, Claude, Kirchner, Florent, and Kirchner, Hélène. Strategic computation and deduction. Pp. 324–349.Google Scholar
Benzmüller, Christoph and Paulson, Larry. Exploring properties of normal multimodal logics in simple type theory with Leo-II. Pp. 386–406.Google Scholar
Miller, Dale. A proof-theoretic approach to the static analysis of logic programs. Pp. 407–426.Google Scholar
Xi, Hongwei. ATS/LF: A type system for constructing proofs as total functional programs. Pp. 427–450.Google Scholar