Hostname: page-component-6bf8c574d5-9nwgx Total loading time: 0 Render date: 2025-02-21T23:29:10.513Z Has data issue: false hasContentIssue false
  • English
  • Français

Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 (1967), pp. 224–236. - Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 (1967), pp. 237–239.

Review products

Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 (1967), pp. 224–236.
Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 (1967), pp. 237–239.

Published online by Cambridge University Press:  12 March 2014

Haskell B. Curry
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
The Journal of Symbolic Logic , Volume 36 , Issue 1 , March 1971 , pp. 171 - 172
Copyright
Copyright © Association for Symbolic Logic 1971

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.)