{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:59:25Z","timestamp":1759147165683},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3917,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0022-0000(02)00020-x","type":"journal-article","created":{"date-parts":[[2002,12,27]],"date-time":"2002-12-27T13:04:53Z","timestamp":1040994293000},"page":"626-638","source":"Crossref","is-referenced-by-count":15,"title":["Monotone simulations of non-monotone proofs"],"prefix":"10.1016","volume":"65","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Galesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0022-0000(02)00020-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(nlog n) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0022-0000(02)00020-X_BIB2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/1521-3870(200111)47:4<461::AID-MALQ461>3.0.CO;2-B","article-title":"Monotone proofs of the pigeon-hole principle","volume":"47","author":"Atserias","year":"2001","journal-title":"Mathematical Logic Quarterly"},{"issue":"3","key":"10.1016\/S0022-0000(02)00020-X_BIB3","first-page":"575","article-title":"Monotone sequent calculus and resolution","volume":"42","author":"B\u0131\u0301lkov\u00e1","year":"2001","journal-title":"Comment. Math. Univ. Carolinae"},{"issue":"4","key":"10.1016\/S0022-0000(02)00020-X_BIB4","doi-asserted-by":"crossref","first-page":"916","DOI":"10.2307\/2273826","article-title":"Polynomial size proofs of the propositional pigeonhole principle","volume":"52","author":"Buss","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0168-0072(01)00040-9","article-title":"On the computational content of intuitionistic propositional proofs","volume":"109","author":"Buss","year":"2001","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB8","series-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"Kraj\u0131\u0301\u010dek","year":"1995"},{"issue":"2","key":"10.1016\/S0022-0000(02)00020-X_BIB9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.2307\/2275541","article-title":"Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic","volume":"62","author":"Kraj\u0131\u0301\u010dek","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB10","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, T. Pitassi, A. Urquhart, Upper and lower bounds for tree-like cutting planes proofs, in: Proceedings of Ninth Annual IEEE Symposium on Logic in Computer Science (LICS), Paris, France, 1994, pp. 220\u2013228.","DOI":"10.1109\/LICS.1994.316069"},{"issue":"3","key":"10.1016\/S0022-0000(02)00020-X_BIB11","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","article-title":"Lower bounds for resolution and cutting planes proofs and monotone computations","volume":"62","author":"Pudl\u00e1k","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB12","doi-asserted-by":"crossref","unstructured":"P. Pudl\u00e1k, On the complexity of the propositional calculus, in: Sets and Proofs, Invited Papers from Logic Colloquium \u201997, Cambridge University Press, Cambridge, 1999, pp. 197\u2013218.","DOI":"10.1017\/CBO9781107325944.010"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB13","first-page":"1033","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"282","author":"Razborov","year":"1985","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB14","series-title":"Proof Theory","author":"Takeuti","year":"1987"},{"issue":"4","key":"10.1016\/S0022-0000(02)00020-X_BIB15","first-page":"141","article-title":"The gap between monotone and non-monotone circuit complexity is exponential","volume":"7","author":"Tardos","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","article-title":"Short monotone formulas for the majority function","volume":"5","author":"Valiant","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(02)00020-X_BIB17","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000200020X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000200020X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T10:29:35Z","timestamp":1554028175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000200020X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S002200000200020X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00020-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}