{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:06:19Z","timestamp":1764587179161},"reference-count":10,"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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90046-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"227-237","source":"Crossref","is-referenced-by-count":23,"title":["Arithmetical hierarchy and complexity of computation"],"prefix":"10.1016","volume":"8","author":[{"given":"Petr","family":"H\u00e1jek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90046-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(79)90046-X_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ? NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90046-X_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. Third Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90046-X_BIB4","series-title":"Mathematical Foundations of Computer Science","first-page":"255","article-title":"On the relation of deterministic and nondeterministic complexity classes","volume":"45","author":"Dekhtyar","year":"1976"},{"key":"10.1016\/0304-3975(79)90046-X_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4064\/fm-49-1-35-92","article-title":"Arithmetization of metamathematics in a general setting","volume":"49","author":"Feferman","year":"1960","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(79)90046-X_BIB6","series-title":"Mathematical Foundations of Computer Science 1977","first-page":"282","article-title":"Arithmetical complexity of some problems in computer science","volume":"53","author":"H\u00e1jek","year":"1977"},{"key":"10.1016\/0304-3975(79)90046-X_BIB7","first-page":"223","article-title":"Relations between diagonalization, proof systems and complexity gaps (preliminary version)","author":"Hartmanis","year":"1977","journal-title":"Proceedings 9th ACM Symp. on Theory of Computing"},{"issue":"4","key":"10.1016\/0304-3975(79)90046-X_BIB8","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":"SIGACT News"},{"key":"10.1016\/0304-3975(79)90046-X_BIB9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.4064\/fm-42-2-259-270","article-title":"Examples of sets definable by means of two and three quantifiers","volume":"42","author":"Mostowski","year":"1955","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(79)90046-X_BIB10","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990046X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990046X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:20Z","timestamp":1555125800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439757990046X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["030439757990046X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90046-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}