{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:01:37Z","timestamp":1649174497604},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch math Logik"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1007\/bf02011876","type":"journal-article","created":{"date-parts":[[2005,8,11]],"date-time":"2005-08-11T17:32:17Z","timestamp":1123781537000},"page":"157-164","source":"Crossref","is-referenced-by-count":2,"title":["Consistency proof without transfinite induction for a formal system for turing machines"],"prefix":"10.1007","volume":"19","author":[{"given":"Salvatore","family":"Caporaso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02011876_CR1","first-page":"187","volume":"3","author":"C. B\u00f6hm","year":"1964","unstructured":"B\u00f6hm, C.: On a family of Turing machines and the related programming language. ICC Bull.3, 187\u2013194 (1964).","journal-title":"ICC Bull."},{"key":"BF02011876_CR2","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., Jacopini, G.: Flow diagrams, Turing machines, and languages with only two formation rules. Comm. ACM9, 366\u2013371 (1966).","journal-title":"Comm. ACM"},{"key":"BF02011876_CR3","unstructured":"Caporaso, S.: Structuring Hermes' variant of Turing machines. Technical Reports of the Dept. of computer science, University of Bari, 1976."},{"key":"BF02011876_CR4","volume-title":"Foundations of mathematical logic","author":"H.B. Curry","year":"1963","unstructured":"Curry, H.B.: Foundations of mathematical logic. New York: McGraw-Hill 1963."},{"key":"BF02011876_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/320856.320867","volume":"4","author":"Hao Wang","year":"1957","unstructured":"Hao Wang: A variant to Turing's theory of calculating machines. JACM4, 63\u201392 (1957)","journal-title":"JACM"},{"key":"BF02011876_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-01462-2","volume-title":"Aufz\u00e4hlbarkeit, Entscheidbarkeit, Berechenbarkeit","author":"H. Hermes","year":"1961","unstructured":"Hermes, H.: Aufz\u00e4hlbarkeit, Entscheidbarkeit, Berechenbarkeit. Berlin, Heidelberg, New York: Springer 1961."},{"key":"BF02011876_CR7","volume-title":"Introduction to metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to metamathematics. Amsterdam: North-Holland 1952."},{"key":"BF02011876_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.2307\/2270324","volume":"33","author":"G. Kreisel","year":"1968","unstructured":"Kreisel, G.: A survey of proof theory. JSL33, 321\u2013387 (1968).","journal-title":"JSL"},{"key":"BF02011876_CR9","volume-title":"Les limitations internes des formalismes","author":"J. Ladriere","year":"1957","unstructured":"Ladriere, J.: Les limitations internes des formalismes. Paris: Gauthiers-Villars 1957."},{"key":"BF02011876_CR10","unstructured":"Markov, A.: Theory of algorithms, Engl. translation, Jerusalem, 1962."},{"key":"BF02011876_CR11","volume-title":"Introduction to mathematical logic","author":"E. Mendelson","year":"1964","unstructured":"Mendelson, E.: Introduction to mathematical logic. New York: Van Nostrand 1964."},{"key":"BF02011876_CR12","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967."},{"key":"BF02011876_CR13","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01342849","volume":"122","author":"K. Sch\u00fctte","year":"1951","unstructured":"Sch\u00fctte, K.: Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie. Math. Ann.122, 369\u2013389 (1951).","journal-title":"Math. Ann."},{"key":"BF02011876_CR14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/2270132","volume":"30","author":"W.W. Tait","year":"1965","unstructured":"Tait, W.W.: Functionals defined by transfinite induction. JSL30, 155\u2013174 (1965).","journal-title":"JSL"},{"key":"BF02011876_CR15","volume-title":"Proof theory","author":"G. Takeuti","year":"1975","unstructured":"Takeuti, G.: Proof theory. Amsterdam: North-Holland 1975."}],"container-title":["Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011876.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02011876\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:24:58Z","timestamp":1557786298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02011876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF02011876"],"URL":"https:\/\/doi.org\/10.1007\/bf02011876","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}