Closing the circle: An analysis of Emil post's early work

Bulletin of Symbolic Logic 12 (2):267-289 (2006)
  Copy   BIBTEX

Abstract

In 1931 Kurt Gödel published his incompleteness results, and some years later Church and Turing showed that the decision problem for certain systems of symbolic logic has a negative solution. However, already in 1921 the young logician Emil Post worked on similar problems which resulted in what he called an “anticipation” of these results. For several reasons though he did not submit these results to a journal until 1941. This failure ‘to be the first’, did not discourage him: his contributions to mathematical logic and its foundations should not be underestimated. It is the purpose of this article to show that an interest in the early work of Emil Post should be motivated not only by this historical fact, but also by the fact that Post’s approach and method differs substantially from those offered by Gödel, Turing and Church. In this paper it will be shown how this method evolved in his early work and how it finally led him to his results

Links

PhilArchive



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

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

Analytic philosophy: beginnings to the present.Jordan J. Lindberg - 2000 - Mountain View, Calif.: Mayfield Pub. Co..
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.
On the Mathematical Foundations of Syntactic Structures.Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):277-296.
Note on a conjecture of Skolem.Emil L. Post - 1946 - Journal of Symbolic Logic 11 (3):73-74.
The vienna circle's 'anti-foundationalism'.Thomas Oberdan - 1998 - British Journal for the Philosophy of Science 49 (2):297-308.
Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
Closing the Circle: An Analysis of Emil Post's Early Work.Liesbeth De Mol - 2006 - Bulletin of Symbolic Logic 12 (2):267 - 289.

Analytics

Added to PP
2009-02-05

Downloads
49 (#316,480)

6 months
7 (#425,192)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From Curry to Haskell.Felice Cardone - 2020 - Philosophy and Technology 34 (1):57-74.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Minds, Machines and Gödel.J. R. Lucas - 1961 - Etica E Politica 5 (1):1.
The Calculi of Lambda-Conversion.Barkley Rosser - 1941 - Journal of Symbolic Logic 6 (4):171-171.
Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.

Add more references