Search results
Emil Leon Post (/ p oʊ s t /; February 11, 1897 – April 21, 1954) was an American mathematician and logician. He is best known for his work in the field that eventually became known as computability theory .
Emil Post was a Polish-born American mathematician and logician who is best known for his work on polyadic groups, recursively enumerable sets, and degrees of unsolvability, as well as for his contribution to the unsolvability of problems in combinatorial mathematics.
1 day ago · Polish-born American mathematician and logician. Post introduced the truth-table method for defining and checking validity in propositional logic. His unpublished researches into problems of completeness and decidability interestingly anticipated the 1930s results of Gödel, Church, and Turing.
Emil Leon Post was born on February 11 1897 into an Orthodox Jewish family in August ́ow, a town at that time within the Russian empire, but after 1918 in the province of Bialystok in Eastern Poland. In 1897 his father Arnold emigrated to join his brother in America.
- 326KB
- 50
Emil Leon Post was a Polish-born American mathematical logician. Post’s work was a major contribution to the development of modern logic, and more specifically, many-valued logics.
The collection contains photoduplicates of mathematical treatises by Emil L. Post (1897-1954), including his work on closed truth systems, creative logic, the theory of finite processes, definability, and absolutely unsolvable problems.
People also ask
Who was Emil Leon Post?
Who was Emil Post?
Where did Emil Post Live?
Who were Emil Post's parents?
This paper is dedicated to the memory of Emil Leon Post. Abstract. In 1931 Kurt Gddel 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
Related searches
Searches related to Emil Leon Post
emil leon post office
