Finite combinatory processes—formulation

Journal of Symbolic Logic 1 (3):103-105 (1936)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269031

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

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

Through your library

My notes

Similar books and articles

Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
Post Emil L.. Finite combinatory processes—formulation 1.Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):43-43.
Finite combinatory processes. Formulation I.Alonzo Church - 1965 - In Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Hewlett, NY, USA: Dover Publication. pp. 289.
Review: V. A. Uspensky, R. Alavina, Post's Machine; Emil L. Post, Finite Combinatory Processes--Formulation I. [REVIEW]T. Thacher Robinson - 1986 - Journal of Symbolic Logic 51 (1):253-254.
Emil L. Post. Finite combinatory processes—formulation 1. The journal of symbolic logic, vol. 1 (1936), pp. 103–105.Alonzo Church & Emil L. Post - 1937 - Journal of Symbolic Logic 2 (1):43-43.
V. A. Uspensky. Post's machine. English translation by R. Alavina of Mašina Posta. Little mathematics library. Mir Publishers, Moscow, also distributed by Imported Publications, Chicago, 1983, 88 pp. - Emil L. Post. Finite combinatory processes—formulation 1. A reprint of II 43. Therein, pp. 84–88. [REVIEW]T. Thacher Robinson - 1986 - Journal of Symbolic Logic 51 (1):253-254.
Post Emil L.. Note on a conjecture of Skolem.S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (1):28-28.
Review: Emil L. Post, The Two-valued Iterative Systems of Mathematical Logic. [REVIEW]H. E. Vaughan - 1941 - Journal of Symbolic Logic 6 (3):114-115.
Review: Emil L. Post, Note on a Conjecture of Skolem. [REVIEW]S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (1):28-28.
Post Emil L.. Recursive unsolvability of a problem of Thue.S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (3):90-91.

Analytics

Added to PP
2009-01-28

Downloads
246 (#85,130)

6 months
9 (#436,631)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Tractable Cognition Thesis.Iris Van Rooij - 2008 - Cognitive Science 32 (6):939-984.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Constructing a Philosophy of Science of Cognitive Science.William Bechtel - 2009 - Topics in Cognitive Science 1 (3):548-569.

View all 42 citations / Add more citations

References found in this work

No references found.

Add more references