Solvability, Provability, Definability: The Collected Works of Emil L. Post

Birkhauser (1994)
  Copy   BIBTEX

Abstract

Emil Post was a pioneer of 20th century mathematical logic whose influence on computer science is particularly remarkable considering his lack of any contact with computing machines. Post's approach, revolutionary for the time, was to study logical systems from the outside, using ordinary mathematical methods. His investigations led him to set forth what has become the standard paradigm for studying logical systems. By showing how a system of logic could be viewed as a kind of general combinatorial system, Post provided the basis for much of modern computer science. No index. Annotation copyright by Book News, Inc., Portland, OR.

Links

PhilArchive



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

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

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.
The two-valued iterative systems of mathematical logic.Emil Leon Post - 1941 - London,: H. Milford, Oxford university press.
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.
Post's Machine.V. A. Uspensky, R. Alavina & Emil L. Post - 1986 - Journal of Symbolic Logic 51 (1):253-254.
On the Mathematical Foundations of Syntactic Structures.Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):277-296.
Notebooks on Emil Post.[author unknown] - 1966 - Journal of Symbolic Logic 31 (1):157-158.
Note on a conjecture of Skolem.Emil L. Post - 1946 - Journal of Symbolic Logic 11 (3):73-74.
Emil L. post's doctoral dissertation1.Stanislaw J. Surma - 1973 - In Stanisław J. Surma (ed.), Studies in the History of Mathematical Logic. Wrocław, Zakład Narodowy Im. Ossolinskich. pp. 11.
A Variant of a Recursively Unsolvable Problem.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (2):55-56.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.

Analytics

Added to PP
2015-02-02

Downloads
2 (#1,801,846)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the Mathematical Foundations of Syntactic Structures.Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):277-296.
Leibniz: Regressus, un cálculo para la Silogística.Antonio Benítez & José María Benítez Escario - 2016 - Contrastes: Revista Internacional de Filosofía 15 (1-2):43-64.

Add more citations

References found in this work

No references found.

Add more references