Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-25T16:45:53.274Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Florian Rabe
Florian Rabe*
Affiliation:
Department of Computer Science, Jacobs University, Campus Ring 1, 28759 Bremen, Germany. f.rabe@jacobs-university.de.
Get access Rights & Permissions [Opens in a new window]

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.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 16 , Issue 3 , September 2010 , pp. 409 - 411
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Andrews, Peter B.. Some historical reflections. Pp. 3–34.Google Scholar
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
Brown, Chad E.. M-set models. Pp. 135–158.Google Scholar
Farmer, William M.. Andrews' type theory with undefinedness. Pp. 208–227.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