{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:53Z","timestamp":1760202473529},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0168-0072(91)90036-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"3-29","source":"Crossref","is-referenced-by-count":16,"title":["Propositional consistency proofs"],"prefix":"10.1016","volume":"52","author":[{"given":"Samuel R.","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90036-L_BIB1","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(91)90036-L_BIB2","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\/0168-0072(91)90036-L_BIB3","author":"Buss","year":"1989","journal-title":"An optimal parallel algorithm for formula evaluation"},{"key":"10.1016\/0168-0072(91)90036-L_BIB4","article-title":"Weak formal systems and connections to computational complexity","author":"Buss","year":"1988","journal-title":"Student-written Lecture Notes for a Topics Course at U.C. Berkeley"},{"key":"10.1016\/0168-0072(91)90036-L_BIB5","first-page":"83","article-title":"Feasibly constructive proofs and the propositional calculus","author":"Cook","year":"1975","journal-title":"Proc. 7th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(91)90036-L_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\/0168-0072(91)90036-L_BIB7","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.2307\/2274765","article-title":"Propositional proof systems, the consistency of first-order theories and the complexity of computations","volume":"54","author":"Kraj\u00ed\u010dek","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90036-L_BIB8","series-title":"Logic Colloquium '84","first-page":"165","article-title":"On the lenghts of proofs of finitistic consistency statements in first order theories","author":"Pudl\u00e1k","year":"1986"},{"key":"10.1016\/0168-0072(91)90036-L_BIB9","first-page":"309","article-title":"Improved bounds to the lengths of proofs of finitistic consistency statements","volume":"65","author":"Pudl\u00e1k","year":"1987"},{"key":"10.1016\/0168-0072(91)90036-L_BIB10","series-title":"PhD Thesis","article-title":"On the lenghts of proofs in the propositional calculus","author":"Reckhow","year":"1976"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190036L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190036L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:52:48Z","timestamp":1555141968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190036L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["016800729190036L"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90036-l","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}