{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:08Z","timestamp":1725489488109},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427520"},{"type":"electronic","value":"9783540455042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45504-3_9","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T18:56:02Z","timestamp":1187031362000},"page":"130-152","source":"Crossref","is-referenced-by-count":0,"title":["Proof Theory and Post-turing Analysis"],"prefix":"10.1007","author":[{"given":"Lew","family":"Gordeew","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"9_CR1","unstructured":"[B]S. Buss,Bounded arithmetic, Bibliopolis, Napoli (1986)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"H.A. Haken","year":"1985","unstructured":"[H]A. Haken,The intractability of resolution,Theor.Comp.Sci. 39 (1985), 297\u2013308","journal-title":"Theor.Comp.Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/2269031","volume":"1","author":"P.E. Post","year":"1936","unstructured":"[P]E. Post,Finite combinatory processes-formulation I, Journ.Symb.Logic 1 (1936),103\u2013105","journal-title":"Journ.Symb.Logic"},{"issue":"2","key":"9_CR4","first-page":"110","volume":"39","author":"T.G. Takeuti","year":"1987","unstructured":"[T]G. Takeuti,Computational complexity and proof theory, Sugaku 39(2), 1987, 110\u2013123 (Transl.inAMSSugaku expositions0(1),1988,1-14)","journal-title":"Sugaku"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"Tu_A. Turing","year":"1937","unstructured":"[Tu]_A. Turing,On computable numbers, with an application to the Entschei-dungsproblem, Proc.London Math.Soc.42(1937), 230\u2013265","journal-title":"Proc.London Math.Soc."}],"container-title":["Lecture Notes in Computer Science","Proof Theory in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45504-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:05:48Z","timestamp":1548342348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45504-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427520","9783540455042"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45504-3_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}