{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T05:30:32Z","timestamp":1697693432087},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T00:00:00Z","timestamp":1101340800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[2005,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that the feasibly constructive arithmetic theory IPV does not prove (double negation of) LMIN(NP), unless the polynomial hierarchy CPV\u2010provably collapses. It is proved that PV plus (double negation of) LMIN(NP) intuitionistically proves PIND(coNP). It is observed that PV + PIND(NP \u222a coNP) does not intuitionistically prove NPB, a scheme which states that the extended Frege systems are not polynomially bounded. (\u00a9 2004 WILEY\u2010VCH Verlag GmbH &amp; Co. KGaA, Weinheim)<\/jats:p>","DOI":"10.1002\/malq.200410008","type":"journal-article","created":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T08:46:51Z","timestamp":1101372411000},"page":"73-76","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial induction and length minimization in intuitionistic bounded arithmetic"],"prefix":"10.1002","volume":"51","author":[{"given":"Morteza","family":"Moniri","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,11,25]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.2307\/2695075"},{"key":"e_1_2_1_3_2","unstructured":"S. R.Buss Bounded Arithmetic (Bibliopolis 1986)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"S. R.Buss On model theory for intuitionistic bounded arithmetic with applications to independence results. In: Feasible mathematics (S. R. Buss and P. J. Scott eds.) pp. 27\u201347 (Birkh\u00e4user 1990).","DOI":"10.1007\/978-1-4612-3466-1_3"},{"key":"e_1_2_1_5_2","unstructured":"C. C.Chang andJ.Keisler Model Theory (North\u2010Holland 1990)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90044-E"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"J.Krajicek Bounded Arithmetic Propositional Logic and Complexity Theory (Cambridge University Press 1995).","DOI":"10.1017\/CBO9780511529948"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310045"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.6.881"},{"key":"e_1_2_1_10_2","unstructured":"A. S.Troelstra andD.van Dalen Constructivism in Mathematics vol. I (North\u2010Holland 1988)."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200410008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200410008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T19:56:27Z","timestamp":1697658987000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200410008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11,25]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1002\/malq.200410008"],"URL":"https:\/\/doi.org\/10.1002\/malq.200410008","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11,25]]}}}