{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T21:34:27Z","timestamp":1763760867737,"version":"3.45.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,10,12]]},"abstract":"<jats:p>It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P \/ poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of complexity theory. We observe that their approach can be extended to show that the stronger conjectures NEXP not in EXP \/ poly and NEXP not in coNEXP are consistent with a stronger theory, which includes every true universal number-sort sentence.<\/jats:p>","DOI":"10.46298\/lmcs-21(4:23)2025","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T21:30:06Z","timestamp":1763760606000},"source":"Crossref","is-referenced-by-count":0,"title":["On the consistency of stronger lower bounds for NEXP"],"prefix":"10.46298","volume":"Volume 21, Issue 4","author":[{"given":"Neil","family":"Thapen","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,11,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2504.03320v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2504.03320v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T21:30:06Z","timestamp":1763760606000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/15468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(4:23)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2504.03320v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2504.03320v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2504.03320","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2504.03320","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,21]]},"article-number":"15468"}}