{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:14:26Z","timestamp":1760202866026,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-36755-8_9","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T10:05:16Z","timestamp":1576490716000},"page":"128-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Globally Sound Analytic Calculus for Henkin Quantifiers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7815-2501","authenticated-orcid":false,"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4753-7302","authenticated-orcid":false,"given":"Anela","family":"Lolic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1017\/jsl.2018.51","volume":"84","author":"JP Aguilera","year":"2019","unstructured":"Aguilera, J.P., Baaz, M.: Unsound inferences make proofs shorter. J. Symb. Log. 84(1), 102\u2013122 (2019). \nhttps:\/\/doi.org\/10.1017\/jsl.2018.51","journal-title":"J. Symb. Log."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-662-59533-6_29","volume-title":"Logic, Language, Information, and Computation","author":"M Baaz","year":"2019","unstructured":"Baaz, M., Lolic, A.: Note on globally sound analytic calculi for quantifier macros. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 486\u2013497. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-662-59533-6_29"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.2307\/2270594","volume":"30","author":"L Henkin","year":"1961","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. J. Symb. Log. 30, 167\u2013183 (1961). \nhttps:\/\/doi.org\/10.2307\/2270594","journal-title":"J. Symb. Log."},{"key":"9_CR4","series-title":"Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science)","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-94-017-0522-6_7","volume-title":"Quantifiers: Logics, Models and Computation","author":"M Krynicki","year":"1995","unstructured":"Krynicki, M., Mostowski, M.: Henkin quantifiers. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds.) Quantifiers: Logics, Models and Computation. Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science), vol. 248, pp. 193\u2013262. Springer, Dordrecht (1995). \nhttps:\/\/doi.org\/10.1007\/978-94-017-0522-6_7"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.4064\/fm-138-2-93-101","volume":"138","author":"EGK Lopez-Escobar","year":"1991","unstructured":"Lopez-Escobar, E.G.K.: Formalizing a non-linear Henkin quantifier. Fundamenta Mathematicae 138(2), 93\u2013101 (1991)","journal-title":"Fundamenta Mathematicae"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00153-004-0220-8","volume":"43","author":"M Mostowski","year":"2004","unstructured":"Mostowski, M., Zdanowski, K.: Degrees of logics with Henkin quantifiers in poor vocabularies. Arch. Math. Log. 43(5), 691\u2013702 (2004). \nhttps:\/\/doi.org\/10.1007\/s00153-004-0220-8","journal-title":"Arch. Math. Log."},{"key":"9_CR7","volume-title":"Proof Theory","author":"G Takeuti","year":"1987","unstructured":"Takeuti, G.: Proof Theory, 2nd edn. North-Holland, Amsterdam (1987)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T19:04:06Z","timestamp":1576782246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","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":"30","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":"17","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":"0","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":"57% - 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":"3.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":"3.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}