{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:33:33Z","timestamp":1648575213057},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,24]],"date-time":"2008-05-24T00:00:00Z","timestamp":1211587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s00153-008-0068-4","type":"journal-article","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T12:54:35Z","timestamp":1211547275000},"page":"35-52","source":"Crossref","is-referenced-by-count":0,"title":["On meta complexity of propositional formulas and propositional proofs"],"prefix":"10.1007","volume":"47","author":[{"given":"Pavel","family":"Naumov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,24]]},"reference":[{"issue":"1","key":"68_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook S.A., Reckhow R.A.: The relative efficiency of propositional proof systems. J. Symbolic Logic 44(1), 36\u201350 (1979)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"68_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W. Cook","year":"1987","unstructured":"Cook W., Coullard C.R., Tur\u00e1n Gy.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"68_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39(2\u20133), 297\u2013308 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"68_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.4064\/fm182-2-7","volume":"182","author":"J. Kraj\u00ed\u010dek","year":"2004","unstructured":"Kraj\u00ed\u010dek J.: Diagonalization in proof complexity. Fund. Math. 182(2), 181\u2013192 (2004)","journal-title":"Fund. Math."},{"issue":"2","key":"68_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.2178\/jsl\/1082418532","volume":"69","author":"J. Kraj\u00ed\u010dek","year":"2004","unstructured":"Kraj\u00ed\u010dek J.: Implicit proofs. J. Symbolic Logic 69(2), 387\u2013397 (2004)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"68_CR6","doi-asserted-by":"crossref","first-page":"619","DOI":"10.2178\/jsl\/1120224731","volume":"70","author":"J. Kraj\u00ed\u010dek","year":"2005","unstructured":"Kraj\u00ed\u010dek J.: Structured pigeonhole principle, search problems and hard tautologies. J. Symbolic Logic 70(2), 619\u2013630 (2005)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"68_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/rsa.3240070103","volume":"7","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek J., Pudl\u00e1k P., Woods A.: An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Struct. Algorithms 7(1), 15\u201339 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"68_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/S0002-9947-1973-0432416-X","volume":"177","author":"R.J. Parikh","year":"1973","unstructured":"Parikh R.J.: Some results on the lengths of proofs. Trans. Am. Math. Soc. 177, 29\u201336 (1973)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"68_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01200117","volume":"3","author":"T. Pitassi","year":"1993","unstructured":"Pitassi T., Beame P., Impagliazzo R.: Exponential lower bounds for the pigeonhole principle. Comput. Complexity 3(2), 97\u2013140 (1993)","journal-title":"Comput. Complexity"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0068-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-008-0068-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-008-0068-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:36:42Z","timestamp":1558625802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-008-0068-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,24]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s00153-008-0068-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,24]]}}}