{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:22Z","timestamp":1781259502364,"version":"3.54.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T00:00:00Z","timestamp":1486080000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T00:00:00Z","timestamp":1486080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T00:00:00Z","timestamp":1486080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We establish unconditionally that for every integer $k \\geq 1$ there is a language $L \\in \\mbox{P}$ such that it is consistent with Cook's theory PV that $L \\notin Size(n^k)$. Our argument is non-constructive and does not provide an explicit description of this language.<\/jats:p>","DOI":"10.23638\/lmcs-13(1:4)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:31:01Z","timestamp":1743701461000},"source":"Crossref","is-referenced-by-count":1,"title":["Unprovability of circuit upper bounds in Cook's theory PV"],"prefix":"10.23638","volume":"Volume 13, Issue 1","author":[{"given":"Jan","family":"Krajicek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor C.","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2017,2,3]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1605.00263v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1605.00263v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:31:02Z","timestamp":1743701462000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(1:4)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1605.00263","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1605.00263","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,3]]},"article-number":"3119"}}