{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:03:45Z","timestamp":1725879825598},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319418414"},{"type":"electronic","value":"9783319418421"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41842-1_7","type":"book-chapter","created":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T17:01:15Z","timestamp":1485968475000},"page":"175-208","source":"Crossref","is-referenced-by-count":1,"title":["Why Post Did [Not] Have Turing\u2019s Thesis"],"prefix":"10.1007","author":[{"given":"Wilfried","family":"Sieg","sequence":"first","affiliation":[]},{"given":"M\u00e1t\u00e9","family":"Szab\u00f3","sequence":"additional","affiliation":[]},{"given":"Dawn","family":"McLaughlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Awodey, Steve and Reck, Erich. 2002. \u201cCompleteness and Categoricity, Part II: 20th Century Metalogic to 21st Century Semantics.\u201d History and Philosophy of Logic 23, no. 2: 77\u201394.","DOI":"10.1080\/0144534021000028619"},{"key":"7_CR2","unstructured":"Bernays, Paul. 1918. Beitr\u00e4ge zur axiomatischen Behandlung des Logik-Kalk\u00fcls. Habilitations-schrift. G\u00f6ttingen. Reprinted in [20], 222\u201368."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01283841","volume":"25","author":"Paul Bernays","year":"1926","unstructured":"Bernays, Paul. 1926. \u201cAxiomatische Untersuchung des Aussagen-Kalk\u00fcls der \u2018Principia Mathematica\u2019.\u201d Mathematische Zeitschrift 25, 305\u2013320.","journal-title":"Mathematische Zeitschrift"},{"key":"7_CR4","first-page":"332","volume":"41","author":"Alonzo Church","year":"1935","unstructured":"Church, Alonzo. 1935. \u201cAn Unsolvable Problem of Elementary Number Theory. Preliminary Report (Abstract).\u201d Bulletin of the American Mathematical Society 41: 332\u201333.","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"2","key":"7_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"Alonzo Church","year":"1936","unstructured":"Church, Alonzo. 1936. \u201cAn Unsolvable Problem of Elementary Number Theory.\u201d The American Journal of Mathematics 58, no. 2: 345\u201363.","journal-title":"The American Journal of Mathematics"},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2307\/2268812","volume":"2","author":"Alonzo Church","year":"1937","unstructured":"Church, Alonzo. 1937. \u201cReview of (Post, 1936).\u201d The Journal of Symbolic Logic 2, no. 1: 43.","journal-title":"The Journal of Symbolic Logic"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1090\/S0002-9904-1938-06720-1","volume":"44","author":"Alonzo Church","year":"1938","unstructured":"Church, Alonzo. 1938. \u201cThe Constructive Second Number Class.\u201d Bulletin of the American Mathematical Society 44, 224\u201332.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"7_CR8","unstructured":"Davis, Martin. 1950. On the Theory of Recursive Unsolvability. Dissertation, Princeton University."},{"key":"7_CR9","volume-title":"Computability and Unsolvability","author":"Martin Davis","year":"1958","unstructured":"Davis, Martin. 1958. Computability and Unsolvability. New York: McGraw-Hill."},{"issue":"1\u20132","key":"7_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(82)91226-8","volume":"54","author":"Martin Davis","year":"1982","unstructured":"Davis, Martin. 1982. \u201cWhy G\u00f6del Didn\u2019t Have Church\u2019s Thesis.\u201d Information and Control 54, no. 1\u20132: 3\u201324.","journal-title":"Information and Control"},{"key":"7_CR11","unstructured":"Davis, Martin. 1994. \u201cEmil L. Post: His Life and Work.\u201d In [14], xi\u2013xxviii."},{"key":"7_CR12","first-page":"2004","volume-title":"The Undecidable. Hewlett, New York: Raven Press","year":"1965","unstructured":"Davis, Martin, ed. 1965. The Undecidable. Hewlett, New York: Raven Press. Reprinted by Dover Publications, Mineola, N.Y., 2004."},{"key":"7_CR13","volume-title":"Solvability, Provability, Definability: The Collected Works of Emil L","author":"Martin Davis","year":"1994","unstructured":"Davis, Martin. 1994. Solvability, Provability, Definability: The Collected Works of Emil L. Post. Basel: Birkh\u00e4user."},{"key":"7_CR14","unstructured":"Davis, Martin and Wilfried Sieg. 2016. \u201cConceptual Confluence in 1936: Post & Turing.\u201d In Turing Centenary Volume edited by Thomas Strahm and Giovanni Sommaruga. Basel: Birkh\u00e4user, 3\u201327."},{"key":"7_CR15","volume-title":"Was sind und was sollen die Zahlen?","author":"Richard Dedekind","year":"1888","unstructured":"Dedekind, Richard. 1888. Was sind und was sollen die Zahlen? Braunschweig: Vieweg."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"De Mol, Liesbeth. 2006. \u201cClosing the Circle. An Analysis of Emil Post\u2019s Early Work.\u201d The Bulletin of Symbolic Logic 12, no. 2: 267\u2013289.","DOI":"10.2178\/bsl\/1146620062"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"De Mol, Liesbeth. 2011. \u201cOn the complex behaviour of simple tag systems. An experimental Approach.\u201d Theoretical Computer Science 412, no. 1\u20132: 97\u2013112.","DOI":"10.1016\/j.tcs.2010.08.026"},{"key":"7_CR18","unstructured":"De Mol, Liesbeth. 2013. \u201cGenerating, Solving and the Mathematics of Homo Sapiens. Emil Post\u2019s Views on Computation.\u201d In A Computable Universe \u2013 Understanding and Exploring Nature as Computation, edited by Hector Zenil. New Jersey: World Scientific, 45\u201362."},{"volume-title":"David Hilbert\u2019s Lectures on the Foundations of Arithmetic and Logic, 1917\u20131933","year":"2013","key":"7_CR19","unstructured":"Ewald, William and Wilfried Sieg, eds. 2013. David Hilbert\u2019s Lectures on the Foundations of Arithmetic and Logic, 1917\u20131933. Heidelberg: Springer."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Feferman, Solomon. 1962. \u201cTransfinite recursive progressions of axiomatic theories.\u201d The Journal of Symbolic Logic 27: 259\u2013316.","DOI":"10.2307\/2964649"},{"key":"7_CR21","first-page":"55","volume-title":"The Universal Turing Machine - A Half-century Survey","author":"Robin Gandy","year":"1988","unstructured":"Gandy, Robin. 1988. \u201cThe confluence of ideas in 1936.\u201d In The Universal Turing Machine \u2013 A Half-century Survey, edited by Rolf Herken. Oxford: Oxford University Press, 55\u2013111."},{"key":"7_CR22","unstructured":"G\u00f6del, Kurt. 1931. \u201cOn Formally Undecidable Propositions of Principia Mathematica and Related Systems I.\u201d Translated by Elliott Mendelson. In [13], 5\u201338."},{"key":"7_CR23","unstructured":"G\u00f6del, Kurt. 1934. \u201cOn Undecidable Propositions of Formal Mathematical Systems.\u201d In [13], 41\u201371."},{"key":"7_CR24","unstructured":"G\u00f6del, Kurt. 1936. \u201cOn the Length of Proofs.\u201d In [13], 82\u20133."},{"key":"7_CR25","unstructured":"G\u00f6del, Kurt. 193?. \u201c[Undecidable Diophantine Propositions].\u201d In Kurt G\u00f6del. Collected Works, edited by Solomon Feferman, et. al. Vol. 3. Oxford: Oxford University Press, 164\u201375."},{"key":"7_CR26","unstructured":"G\u00f6del, Kurt. 1964. \u201cPostscriptum to (G\u00f6del, 1934).\u201d In [13], 71\u20133."},{"key":"7_CR27","unstructured":"G\u00f6del, Kurt. 1972. \u201cSome remarks on the undecidability results.\u201d In Kurt G\u00f6del. Collected Works, edited by Solomon Feferman, et. al. Vol. 2. Oxford: Oxford University Press, 305\u20136."},{"key":"7_CR28","unstructured":"G\u00f6del, Kurt. 2003. \u201cCorrespondence with Emil Post.\u201d In Kurt G\u00f6del. Collected Works, edited by Solomon Feferman, et. al. Vol. 5. Oxford: Oxford University Press, 169\u201374."},{"issue":"890","key":"7_CR29","first-page":"106","volume":"35","author":"Cassius Keyser","year":"1912","unstructured":"Keyser, Cassius. 1912. \u201cPrincipia Mathematica.\u201d Science\u00a0ser. II, vol. 35, no. 890: 106\u201310.","journal-title":"Science ser. II"},{"key":"7_CR30","volume-title":"Mathematical philosophy, a study of fate and freedom; lectures for educated laymen","author":"Cassius Keyser","year":"1922","unstructured":"Keyser, Cassius. 1922. Mathematical philosophy, a study of fate and freedom; lectures for educated laymen. New York: E. P. Dutton & Company."},{"issue":"4","key":"7_CR31","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"Stephen Cole Kleene","year":"1938","unstructured":"Kleene, Stephen Cole. 1938. \u201cOn Notation for Ordinal Numbers.\u201d Journal of Symbolic Logic 3, no. 4: 150\u201355.","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR32","volume-title":"Introduction to Metamathematics","author":"Stephen Cole Kleene","year":"1952","unstructured":"Kleene, Stephen Cole. 1952. Introduction to Metamathematics. Groningen: Elsevier."},{"issue":"1","key":"7_CR33","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MAHC.1981.10004","volume":"3","author":"Stephen Cole Kleene","year":"1981","unstructured":"Kleene, Stephen Cole. 1981. \u201cOrigins of Recursive Function Theory.\u201d Annals of the History of Computing 3, no. 1: 52\u201367.","journal-title":"Annals of the History of Computing"},{"key":"7_CR34","doi-asserted-by":"crossref","DOI":"10.1525\/9780520398252","volume-title":"A Survey of Symbolic Logic","author":"Clarence Irving Lewis","year":"1918","unstructured":"Lewis, Clarence Irving. 1918. A Survey of Symbolic Logic. Berkeley: University of California Press."},{"key":"7_CR35","unstructured":"\u0141ukasiewicz, Jan. 1918. \u201cFarewell Lecture.\u201d In Selected Works of Jan \u0141ukasiewicz, edited by Ludwik Borkowski. Amsterdam: North-Holland Publishing Company. 1970. 84\u20136."},{"key":"7_CR36","unstructured":"\u0141ukasiewicz. 1920. \u201cOn Three-Valued Logic.\u201d In Selected Works of Jan \u0141ukasiewicz, edited by Ludwik Borkowski. Amsterdam: North-Holland Publishing Company. 1970. 87\u20138."},{"key":"7_CR37","volume-title":"Computation: Finite and Infinite Machines","author":"Marvin Minsky","year":"1967","unstructured":"Minsky, Marvin. 1967. Computation: Finite and Infinite Machines. London: Prentice-Hall."},{"issue":"3","key":"7_CR38","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2307\/2370324","volume":"43","author":"Emil Post","year":"1921","unstructured":"Post, Emil. 1921. \u201cIntroduction to a General Theory of Elementary Propositions.\u201d American Journal of Mathematics 43, no. 3: 163\u201385.","journal-title":"American Journal of Mathematics"},{"key":"7_CR39","unstructured":"Post, Emil. 1921. \u201cOn a Simple Class of Deductive Systems. (Abstract)\u201d In Solvability, Provability, Definability: The Collected Works of Emil L. Post. Basel: Birkh\u00e4user. 545."},{"key":"7_CR40","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1090\/S0002-9947-1930-1501560-X","volume":"32","author":"Emil Post","year":"1930","unstructured":"Post, Emil. 1930. \u201cGeneralized differentiation.\u201d Transactions of the American Mathematical Society 32: 723\u201381.","journal-title":"Transactions of the American Mathematical Society"},{"issue":"3","key":"7_CR41","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","volume":"1","author":"Emil Post","year":"1936","unstructured":"Post, Emil. 1936. \u201cFinite Combinatory Processes \u2013 Formulation 1.\u201d The Journal of Symbolic Logic 1, no. 3: 103\u20135.","journal-title":"The Journal of Symbolic Logic"},{"key":"7_CR42","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1090\/S0002-9947-1940-0002894-7","volume":"48","author":"Emil Post","year":"1940","unstructured":"Post, Emil. 1940. \u201cPolyadic groups.\u201d Transactions of the American Mathematical Society 48: 208\u2013350.","journal-title":"Transactions of the American Mathematical Society"},{"key":"7_CR43","volume-title":"The Two-Valued Iterative Systems of Mathematical Logic","author":"Emil Post","year":"1941","unstructured":"Post, Emil. 1941. The Two-Valued Iterative Systems of Mathematical Logic. Princeton. Princeton University Press."},{"issue":"2","key":"7_CR44","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"Emil Post","year":"1943","unstructured":"Post, Emil. 1943. \u201cFormal Reductions of the General Combinatorial Decision Problem.\u201d American Journal of Mathematics 65, no. 2: 197\u2013215.","journal-title":"American Journal of Mathematics"},{"issue":"5","key":"7_CR45","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"Emil Post","year":"1944","unstructured":"Post, Emil. 1944. \u201cRecursively Enumerable Sets of Positive Integers and Their Decision Problems.\u201d American Mathematical Society 50, no. 5: 284\u2013316.","journal-title":"American Mathematical Society"},{"key":"7_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"Emil Post","year":"1947","unstructured":"Post, Emil. 1947. \u201cRecursive unsolvability of a problem of Thue.\u201d Journal of Symbolic Logic 12: 1\u201311.","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR47","unstructured":"Post, Emil. 1965. \u201cAbsolutely Unsolvable Problems and Relatively Undecidable Propositions - Account of an Anticipation.\u201d In [12], 375\u2013441."},{"key":"7_CR48","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1093\/oso\/9780195079296.003.0005","volume-title":"Mathematics and Mind","author":"Wilfried Sieg","year":"1994","unstructured":"Sieg, Wilfried. 1994. \u201cMechanical procedures and mathematical experience.\u201d In Mathematics and Mind, edited by Alexander George. Oxford: Oxford University Press, 71\u2013117."},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Sieg, Wilfried. 1997. \u201cStep by Recursive Step: Church\u2019s Analysis of Effective Calculability\u201d. The Bulletin of Symbolic Logic 3, no. 2: 154\u2013180. Reprinted in 2014. (with a Postscriptum) in Turing\u2019s Legacy: Developments from Turing\u2019s ideas in logic, edited by Rod Downey. Cambridge: Cambridge University Press, 434\u201366.","DOI":"10.2307\/421012"},{"key":"7_CR50","unstructured":"Sieg, Wilfried. 2002. \u201cCalculations by man and machine: conceptual analysis.\u201d In Reflections on the foundations of mathematics, edited by Wilfried Sieg, Richard Sommer, and Carolyn Talcott. Natick: A. K. Peters, 390\u2013409."},{"key":"7_CR51","first-page":"535","volume-title":"Philosophy of Mathematics (Handbook of the Philosophy of Science)","author":"Wilfried Sieg","year":"2009","unstructured":"Sieg, Wilfried. 2009. \u201cOn Computability.\u201d In Philosophy of Mathematics (Handbook of the Philosophy of Science) edited by Andrew Irvine. Amsterdam: North-Holland Publishing Company, 535\u2013630."},{"key":"7_CR52","first-page":"332","volume-title":"Alan Turing - His work and Impact","author":"Wilfried Sieg","year":"2012","unstructured":"Sieg, Wilfried. 2012. \u201cNormal forms for puzzles: A variant of Turing\u2019s Thesis.\u201d In Alan Turing \u2013 His work and Impact, edited by S. Barry Cooper and Jan van Leeuwen. Amsterdam: Elsevier, 332\u20138."},{"key":"7_CR53","doi-asserted-by":"crossref","first-page":"183","DOI":"10.7551\/mitpress\/8009.003.0009","volume-title":"Computability","author":"Wilfried Sieg","year":"2013","unstructured":"Sieg, Wilfried. 2013. \u201cG\u00f6del\u2019s Philosophical Challenge (to Turing).\u201d In Computability, edited by Jack Copeland, Carl Posy, and Oron Shagrir. Cambridge: MIT Press, 183\u2013202."},{"issue":"1","key":"7_CR54","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1162\/POSC_a_00122","volume":"22","author":"Wilfried Sieg","year":"2014","unstructured":"Sieg, Wilfried. 2014. \u201cThe ways of Hilbert\u2019s axiomatics: structural and formal.\u201d Perspectives on Science 22, no. 1: 133\u201357.","journal-title":"Perspectives on Science"},{"key":"7_CR55","unstructured":"Szab\u00f3, M\u00e1t\u00e9. 2014. Post and Kalm\u00e1r on Turing and Church. MS Thesis, Carnegie Mellon University, Department of Philosophy."},{"key":"7_CR56","unstructured":"Turing, Alan. 1936. \u201cOn computable numbers with an application to the Entscheidungsproblem.\u201d Proceedings of the London Mathematical Society, 2, vol. 42: 230\u201365."},{"issue":"45","key":"7_CR57","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"2","author":"Alan Turing","year":"1939","unstructured":"Turing, Alan. 1939. \u201cSystems of logic based on ordinals.\u201d Proceedings of the London Mathematical Society, ser. 2, 45: 161\u2013228.","journal-title":"Proceedings of the London Mathematical Society, ser."},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"Turing, Alan. 1950. \u201cThe word problem in semi-groups with cancellation.\u201d The Annals of Mathematics, Ser. 2, Vol. 52, no. 2: 491\u2013505.","DOI":"10.2307\/1969481"},{"key":"7_CR59","first-page":"7","volume":"31","author":"Alan Turing","year":"1954","unstructured":"Turing, Alan. 1954. \u201cSolvable and unsolvable problems.\u201d Science News 31: 7\u201323.","journal-title":"Science News"},{"key":"7_CR60","unstructured":"Urquhart, Alasdair. 2009. \u201cEmil Post.\u201d In Handbook of the History of Logic. Logic from Russell to Church, edited by Dov M. Gabbay and John Woods. Vol. 5. Amsterdam: North\u2013Holland Publishing Company. 429\u201378."},{"key":"7_CR61","volume-title":"Principia Mathematica","author":"Alfred Whitehead","year":"1910","unstructured":"Whitehead, Alfred and Bertrand Russell. 1910. Principia Mathematica. Vol. 1. Cambridge: Cambridge University Press."}],"container-title":["Outstanding Contributions to Logic","Martin Davis on Computability, Computational Logic, and Mathematical Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41842-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T06:00:49Z","timestamp":1719036049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41842-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319418414","9783319418421"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41842-1_7","relation":{},"ISSN":["2211-2758","2211-2766"],"issn-type":[{"type":"print","value":"2211-2758"},{"type":"electronic","value":"2211-2766"}],"subject":[],"published":{"date-parts":[[2016]]}}}