Finite combinatory processes. Formulation I

In Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication. pp. 289 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Finite type structures within combinatory algebras.Inge Bethke - 1991 - Annals of Pure and Applied Logic 55 (2):101-123.
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..
Partial Combinatory Algebras of Functions.Jaap van Oosten - 2011 - Notre Dame Journal of Formal Logic 52 (4):431-448.
The church-Rosser property in dual combinatory logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.

Analytics

Added to PP
2014-02-01

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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