{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:03:03Z","timestamp":1648958583881},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":11369,"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":[[1982,6]]},"DOI":"10.1016\/0304-3975(82)90068-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"259-268","source":"Crossref","is-referenced-by-count":9,"title":["Unprovability of theorems of complexity theory in weak number theories"],"prefix":"10.1016","volume":"18","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90068-8_BIB1","first-page":"153","article-title":"Some connections between computational complexity theory and mathematical logic","author":"DeMillo","year":"1979","journal-title":"Proc. 11th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90068-8_BIB2","first-page":"45","article-title":"The consistency of \u201cN = NP\u201d and related problems with fragments of number theory","author":"DeMillo","year":"1980","journal-title":"Proc. 12th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90068-8_BIB3","series-title":"PhD Dissertation","article-title":"Topics in Complexity Theory","author":"Fortune","year":"1979"},{"key":"10.1016\/0304-3975(82)90068-8_BIB4","doi-asserted-by":"crossref","unstructured":"S. Fortune, D. Leivant and M. O'Donnell, The expressiveness of simple and second order type structures, J. ACM. to appear.","DOI":"10.1145\/322358.322370"},{"key":"10.1016\/0304-3975(82)90068-8_BIB5","first-page":"328","article-title":"Hilbert's tenth problem","volume":"28","author":"Davis","year":"1976","journal-title":"Proc. Symposia Pure Math."},{"issue":"4","key":"10.1016\/0304-3975(82)90068-8_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":"SIGACT News"},{"key":"10.1016\/0304-3975(82)90068-8_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90068-8_BIB8","first-page":"58","article-title":"Independence results in computer science?","author":"Joseph","year":"1980","journal-title":"Proc. 12th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90068-8_BIB9","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(82)90068-8_BIB10","first-page":"238","author":"Kreisel","year":"1971","journal-title":"The Collected Papers of Gerhard Gentzen, J. Philosophy"},{"key":"10.1016\/0304-3975(82)90068-8_BIB11","series-title":"Report TR 79-390","article-title":"On easily infinite sets and on a statement of R. Lipton","author":"Leivant","year":"1979"},{"key":"10.1016\/0304-3975(82)90068-8_BIB12","first-page":"38","article-title":"The complexity of argument passing in polymorphic procedures","author":"Leivant","year":"1981","journal-title":"Proc. 13th Annual Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90068-8_BIB13","doi-asserted-by":"crossref","unstructured":"D. Leivant, The optimality of induction as an axiomatization of arithmetic, J. Symbolic Logic, to appear.","DOI":"10.2307\/2273332"},{"key":"10.1016\/0304-3975(82)90068-8_BIB14","first-page":"176","article-title":"Model theoretic aspects of complexity theory","author":"Lipton","year":"1978","journal-title":"Proc. 19th Symposium on the Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90068-8_BIB15","first-page":"176","article-title":"A programming language theorem which is independent of Peano Arithmetic","author":"O'Donnell","year":"1979","journal-title":"Proc. 11th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90068-8_BIB16","series-title":"Intuitionism and Proof Theory","first-page":"459","article-title":"On a number theoretic choice schema and its relation to induction","author":"Parsons","year":"1970"},{"key":"10.1016\/0304-3975(82)90068-8_BIB17","series-title":"Technical Report 2","article-title":"Degree of difficulty of computing a function and a partial ordering of recursive sets","author":"Rabin","year":"1960"},{"key":"10.1016\/0304-3975(82)90068-8_BIB18","series-title":"Handbook of Mathematical Logic","first-page":"821","article-title":"The incompleteness theorems","author":"Smorynski","year":"1977"},{"key":"10.1016\/0304-3975(82)90068-8_BIB19","series-title":"Metamathematical Investigation of Intuitionistic Arithmetic and Analysis","author":"Troelstra","year":"1974"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900688?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900688?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:30Z","timestamp":1555111590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0304397582900688"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90068-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}