Review: Emil L. Post, A Variant of a Recursively Unsolvable Problem [Book Review]

Journal of Symbolic Logic 12 (2):55-56 (1947)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

Closing the circle: An analysis of Emil post's early work.Liesbeth de Mol - 2006 - Bulletin of Symbolic Logic 12 (2):267-289.
Closing the Circle: An Analysis of Emil Post's Early Work.Liesbeth De Mol - 2006 - Bulletin of Symbolic Logic 12 (2):267 - 289.
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.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.

Analytics

Added to PP
2013-11-22

Downloads
18 (#711,533)

6 months
3 (#445,838)

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