{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:53:37Z","timestamp":1757627617405,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90047-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"239-253","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Relations between diagonalization, proof systems, and complexity gaps"],"prefix":"10.1016","volume":"8","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90047-1_BIB1","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321679.321691","article-title":"Computational complexity and existence of complexity gaps","volume":"19","author":"Borodin","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(79)90047-1_BIB2","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9947-1965-0175771-6","article-title":"Theory of provable recursive functions","volume":"117","author":"Fischer","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"year":"1977","series-title":"Complexity class of provable recursive functions","author":"Gordon","key":"10.1016\/0304-3975(79)90047-1_BIB3"},{"key":"10.1016\/0304-3975(79)90047-1_BIB4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/321450.321464","article-title":"Computational complexity of one-tape Turing machine computations","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(79)90047-1_BIB5","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the Theory of Computational Complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/0304-3975(79)90047-1_BIB6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1008335.1008336","article-title":"Independence results in computer science","volume":"8","author":"Hartmanis","year":"1976","journal-title":"ACM SIGACT NEWS"},{"key":"10.1016\/0304-3975(79)90047-1_BIB7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-tape simulation of multi-tape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(79)90047-1_BIB8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/800105.803411","article-title":"On time hierarchies","author":"Paul","year":"1977","journal-title":"Proc. Ninth Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90047-1_BIB9","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/322033.322046","article-title":"Optimization among provably equivalent programs","volume":"24","author":"Young","year":"1977","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900471?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900471?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:16Z","timestamp":1757477896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900471"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90047-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1979]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Relations between diagonalization, proof systems, and complexity gaps","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(79)90047-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1979 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}