Degrees of unsolvability and strong forms of LAMBDA R + LAMBDA R [Symbol] LAMBDA R

Notre Dame Journal of Formal Logic 18:545 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Normal Forms in Combinatory Logic.Patricia Johann - 1994 - Notre Dame Journal of Formal Logic 35 (4):573-594.
Strong Normalization and Typability with Intersection Types.Silvia Ghilezan - 1996 - Notre Dame Journal of Formal Logic 37 (1):44-52.
$\Lambda$-elimination in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.
Lambda-calculus terms that reduce to themselves.Bruce Lercher - 1976 - Notre Dame Journal of Formal Logic 17 (2):291-292.
Variable binding term operators in $\lambda $-calculus.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (4):876-878.
Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.

Analytics

Added to PP
2010-08-24

Downloads
24 (#966,050)

6 months
12 (#239,387)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references