Formal Reductions of the General Combinatorial Decision Problem

Journal of Symbolic Logic 8 (1):50-52 (1943)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268006

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,326

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

Review: Emil L. Post, Formal Reductions of the General Combinatorial Decision Problem. [REVIEW]Alonzo Church - 1943 - Journal of Symbolic Logic 8 (1):50-52.
Post Emil L.. Formal reductions of the general combinatorial decision problem. American journal of mathematics, vol. 65 , pp. 197–215. [REVIEW]Alonzo Church - 1943 - Journal of Symbolic Logic 8 (2):50-52.
Post Emil L.. Recursive unsolvability of a problem of Thue.S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (3):90-91.
Emil L. Post and the problem of mechanical provability: a survey of Post's contributions in the centenary of his birth.Halina Święczkowska (ed.) - 1998 - Białystok: Chair of Logic, Informatics and Philisiophy of Science University of Białystok.
Solvability, Provability, Definability: The Collected Works of Emil L. Post.Emil Leon Post & Martin Davis - 1994 - Birkhauser.
Post Emil L.. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, vol. 50 , pp. 284–316. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.
Post Emil L.. Note on a conjecture of Skolem.S. C. Kleene - 1947 - Journal of Symbolic Logic 12 (1):28-28.
Post Emil L.. Finite combinatory processes—formulation 1.Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):43-43.
Strong reductions between combinatorial principles.Damir D. Dzhafarov - 2016 - Journal of Symbolic Logic 81 (4):1405-1431.
Post Emil L.. Conjuntos recurrentemente numerables de enteros positivos y sus problemas de decisión. Spanish translation of X 18 by Fuentes J. R.. Revista matemática hispanoamericana, ser. 4 vol. 7 no. 5 , pp. 187–229. [REVIEW]Hugo Ribeiro - 1948 - Journal of Symbolic Logic 13 (4):217-217.

Analytics

Added to PP
2015-02-05

Downloads
96 (#233,800)

6 months
17 (#181,236)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.

View all 43 citations / Add more citations

References found in this work

No references found.

Add more references