{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:33:02Z","timestamp":1756636382572,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030893903"},{"type":"electronic","value":"9783030893910"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89391-0_25","type":"book-chapter","created":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T11:33:44Z","timestamp":1634211224000},"page":"459-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Henkin-Style Completeness Proof for\u00a0the Modal Logic S5"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5987-7806","authenticated-orcid":false,"given":"Bruno","family":"Bentzen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,15]]},"reference":[{"key":"25_CR1","unstructured":"Carneiro, M.: The lean 3 mathematical library (mathlib) (2018). https:\/\/robertylewis.com\/files\/icms\/Carneiro_mathlib.pdf. International Congress on Mathematical Software"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1019964114625","volume":"15","author":"C Coquand","year":"2002","unstructured":"Coquand, C.: A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions. Higher-Order Symb. Comput. 15(1), 57\u201390 (2002)","journal-title":"Higher-Order Symb. Comput."},{"issue":"2\u20133","key":"25_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Inf. Comput. 76(2\u20133), 95\u2013120 (1988)","journal-title":"Inf. Comput."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-35308-6_18","volume-title":"Certified Programs and Proofs","author":"C Doczkal","year":"2012","unstructured":"Doczkal, C., Smolka, G.: Constructive completeness for modal logic with transitive closure. In: Hawblitzel, C., Miller, D. (eds.) CPP 2012. LNCS, vol. 7679, pp. 224\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35308-6_18"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-08970-6_15","volume-title":"Interactive Theorem Proving","author":"C Doczkal","year":"2014","unstructured":"Doczkal, C., Smolka, G.: Completeness and decidability results for CTL in coq. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 226\u2013241. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08970-6_15"},{"key":"25_CR6","unstructured":"From, A.H.: Epistemic logic. Archive of Formal Proofs, October 2018. https:\/\/devel.isa-afp.org\/entries\/Epistemic_Logic.html. Formal proof development"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-02261-6_17","volume-title":"Logic, Language, Information and Computation","author":"H Herbelin","year":"2009","unstructured":"Herbelin, H., Lee, G.: Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS (LNAI), vol. 5514, pp. 209\u2013217. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02261-6_17"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Hughes, G.E., Cresswell, M.J.: A New Introduction to Modal Logic. Psychology Press (1996)","DOI":"10.4324\/9780203290644"},{"key":"25_CR9","unstructured":"Negri, S.: Kripke completeness revisited. In: Acts of Knowledge: History, Philosophy and Logic: Essays Dedicated to G\u00f6ran Sundholm, pp. 247\u2013282 (2009)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-04652-0_5","volume-title":"Advanced Functional Programming","author":"U Norell","year":"2009","unstructured":"Norell, U.: Dependently typed programming in Agda. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol. 5832, pp. 230\u2013266. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04652-0_5"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0040259","volume-title":"Mathematical Foundations of Programming Semantics","author":"F Pfenning","year":"1990","unstructured":"Pfenning, F., Paulin-Mohring, C.: Inductively defined types in the calculus of constructions. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1989. LNCS, vol. 442, pp. 209\u2013228. Springer, New York (1990). https:\/\/doi.org\/10.1007\/BFb0040259"},{"key":"25_CR12","unstructured":"The Coq project: The coq proof assistant. http:\/\/www.coq.inria.fr (2017)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-40537-2_22","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"H Tews","year":"2013","unstructured":"Tews, H.: Formalizing cut elimination of coalgebraic logics in Coq. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS (LNAI), vol. 8123, pp. 257\u2013272. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40537-2_22"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Wu, M., Gor\u00e9, R.: Verified decision procedures for modal logics. In: Harrison, J., O\u2019Leary, J., Tolmach, A. (eds.) 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 141, pp. 31:1\u201331:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2019.31. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11086","DOI":"10.4230\/LIPIcs.ITP.2019.31"}],"container-title":["Lecture Notes in Computer Science","Logic and Argumentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89391-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T09:03:28Z","timestamp":1642064608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89391-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030893903","9783030893910"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89391-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CLAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic and Argumentation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"clar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.xixilogic.org\/events\/clar2021\/","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":"58","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":"20","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":"10","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":"34% - 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","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","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)"}},{"value":"5 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}