{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:23:10Z","timestamp":1742991790984,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_21","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"342-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Exponential Lower Bound for Proofs in Focused Calculi"],"prefix":"10.1007","author":[{"given":"Raheleh","family":"Jalali","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"unstructured":"Tabatabai, A.A., Jalali, R.: Universal proof theory: semi-analytic rules and interpolation. Manuscript (2019)","key":"21_CR1"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N Alon","year":"1987","unstructured":"Alon, N., Boppana, R.: The monotone circuit complexity of boolean functions. Combinatorica 7(1), 1\u201322 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.apal.2011.09.003","volume":"163","author":"A Ciabattoni","year":"2012","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Ann. Pure Appl. Logic 163(3), 266\u2013290 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.apal.2007.01.001","volume":"146","author":"P Hrube\u0161","year":"2007","unstructured":"Hrube\u0161, P.: A lower bound for intuitionistic logic. Ann. Pure Appl. Logic 146(1), 72\u201390 (2007)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2\u20133","key":"21_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.apal.2008.09.013","volume":"157","author":"P Hrube\u0161","year":"2009","unstructured":"Hrube\u0161, P.: On lengths of proofs in non-classical logics. Ann. Pure Appl. Logic 157(2\u20133), 194\u2013205 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"unstructured":"Iemhoff, R.: Uniform interpolation and sequent calculi in modal logic (2016). \nhttps:\/\/link.springer.com\/article\/10.1007\/s00153-018-0629-0","key":"21_CR6"},{"unstructured":"Iemhoff, R.: Uniform interpolation and the existence of sequent calculi (2017)","key":"21_CR7"},{"doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u010dek, J.: Proof complexity. In: Encyclopaedia of Mathematics and Its Applications, vol. 170, pp. 326\u2013327. Cambridge University Press (2019)","key":"21_CR8","DOI":"10.1017\/9781108242066"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J Kraj\u00ed\u010dek","year":"1997","unstructured":"Kraj\u00ed\u010dek, J.: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic 62(2), 457\u2013486 (1997)","journal-title":"J. Symbolic Logic"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic 62, 981\u2013998 (1997)","journal-title":"J. Symbolic Logic"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0049-237X(98)80016-5","volume-title":"Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics","author":"P Pudl\u00e1k","year":"1998","unstructured":"Pudl\u00e1k, P.: The lengths of proofs. In: Buss, S. (ed.) Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics, vol. 137, pp. 1\u201378. Elsevier, Amsterdam (1998)"},{"doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: On the complexity of propositional calculus, sets and proofs. In: Logic Colloquium 1997, pp. 197\u2013218. Cambridge University Press (1999)","key":"21_CR12","DOI":"10.1017\/CBO9781107325944.010"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1090\/dimacs\/039\/15","volume":"39","author":"P Pudl\u00e1k","year":"1998","unstructured":"Pudl\u00e1k, P., Sgall, J.: Algebraic models of computation and interpolation for algebraic systems. DIMACS Series in Discrete Math. Theor. Comp. Sci. 39, 279\u2013295 (1998)","journal-title":"DIMACS Series in Discrete Math. Theor. Comp. Sci."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0168-0072(99)00002-0","volume":"99","author":"S Buss","year":"1999","unstructured":"Buss, S., Mints, G.: The complexity of the disjunction and existence properties in intuitionistic logic. Ann. Pure Appl. Logic 99, 93\u2013104 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0168-0072(01)00040-9","volume":"109","author":"S Buss","year":"2001","unstructured":"Buss, S., Pudl\u00e1k, P.: On the computational content of intuitionistic propositional proofs. Ann. Pure Appl. Logic 109, 46\u201394 (2001)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:04:34Z","timestamp":1575644674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}