Luis E. Sanchis. Types in combinatory logic. Notre Dame journal of formal logic, vol. 5 no. 3 , pp. 161–180

Journal of Symbolic Logic 32 (3):420-421 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5:161.
Review: Luis E. Sanchis, Types in Combinatory Logic. [REVIEW]Jean Ladriere - 1967 - Journal of Symbolic Logic 32 (3):420-421.
Hyperenumeration reducibility.Luis E. Sanchis - 1978 - Notre Dame Journal of Formal Logic 19 (3):405-415.
A generalization of the Gentzen Hauptsatz.Luis E. Sanchis - 1971 - Notre Dame Journal of Formal Logic 12 (4):499-504.
Functionals defined by recursion.Luis Elpidio Sanchis - 1967 - Notre Dame Journal of Formal Logic 8 (3):161-174.
Types in Combinatory Logic.Jean Ladrière - 1967 - Journal of Symbolic Logic 32 (3):420-421.
Formally defined operations in Kripke models.Luis E. Sanchis - 1973 - Notre Dame Journal of Formal Logic 14 (4):467-480.
A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.

Analytics

Added to PP
2016-06-30

Downloads
20 (#723,940)

6 months
3 (#902,269)

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