{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:02:47Z","timestamp":1759147367316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031166808"},{"type":"electronic","value":"9783031166815"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16681-5_6","type":"book-chapter","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:41:24Z","timestamp":1663299684000},"page":"92-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Wetzel: Formalisation of\u00a0an\u00a0Undecidable Problem Linked to\u00a0the\u00a0Continuum Hypothesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0288-4279","authenticated-orcid":false,"given":"Lawrence C.","family":"Paulson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"6_CR1","unstructured":"Agerholm, S.: A comparison of HOL-ST and Isabelle\/ZF. In: Paulson, L.C. (ed.) Proceedings of the First Isabelle Users Workshop, pp. 53\u201370. Technical Report 379, Computer Laboratory, University of Cambridge, September 1995"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from THE BOOK. Springer, 6th edn. (2018). https:\/\/doi.org\/10.1007\/978-3-662-57265-8","DOI":"10.1007\/978-3-662-57265-8"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Buzzard, K., Commelin, J., Massot, P.: Formalising perfectoid spaces. In: Certified Programs and Proofs, pp. 299\u2013312. Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3372885.3373830","DOI":"10.1145\/3372885.3373830"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"D\u017eamonja, M., Koutsoukou-Argyraki, A., Paulson, L.C.: Formalising ordinal partition relations using Isabelle\/HOL. Experimental Mathematics (in press). https:\/\/doi.org\/10.1080\/10586458.2021.1980464","DOI":"10.1080\/10586458.2021.1980464"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1307\/mmj\/1028999028","volume":"11","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P.: An interpolation problem associated with the continuum hypothesis. Mich. Math. J. 11(1), 9\u201310 (1964)","journal-title":"Mich. Math. J."},{"issue":"3","key":"6_CR6","first-page":"245","volume":"62","author":"SR Garcia","year":"2015","unstructured":"Garcia, S.R., Shoemaker, A.L.: Wetzel\u2019s problem, Paul Erd\u0151s, and the continuum hypothesis: a mathematical mystery. Notices AMS 62(3), 245\u2013247 (2015)","journal-title":"Notices AMS"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0105405","volume-title":"Theorem Proving in Higher Order Logics","author":"M Gordon","year":"1996","unstructured":"Gordon, M.: Set theory, higher order logic or both? In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 191\u2013201. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0105405"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-51054-1_13","volume-title":"Automated Reasoning","author":"E Gunther","year":"2020","unstructured":"Gunther, E., Pagano, M., S\u00e1nchez Terraf, P.: Formalization of forcing in Isabelle\/ZF. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 221\u2013235. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_13"},{"key":"6_CR9","unstructured":"Gunther, E., Pagano, M., Terraf, P.S., Steinberg, M.: The independence of the continuum hypothesis in Isabelle\/ZF. Archive of Formal Proofs, March 2022. https:\/\/isa-afp.org\/entries\/Independence_CH.html, Formal proof development"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Han, J.M., van Doorn, F.: A formal proof of the independence of the continuum hypothesis. In: 9th ACM SIGPLAN Conference on Certified Programs and Proofs, pp. 353\u2013366. CPP 2020, Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3372885.3373826","DOI":"10.1145\/3372885.3373826"},{"key":"6_CR11","unstructured":"Kunen, K.: Set Theory: An Introduction to Independence Proofs. Elsevier, North-Holland (1980)"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: a Proof Assistant for Higher-order Logic. Springer, Berlin (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9, http:\/\/isabelle.in.tum.de\/dist\/Isabelle\/doc\/tutorial.pdf","DOI":"10.1007\/3-540-45949-9"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11921240_19","volume-title":"Theoretical Aspects of Computing","author":"S Obua","year":"2006","unstructured":"Obua, S.: Partizan games in Isabelle\/HOLZF. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds.) ICTAC 2006. LNCS, vol. 4281, pp. 272\u2013286. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11921240_19"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Paulson, L.C.: The foundation of a generic theorem prover. J. Autom. Reasoning 5(3), 363\u2013397 (1989). https:\/\/doi.org\/10.1007\/BF00248324, https:\/\/arxiv.org\/abs\/cs\/9301105","DOI":"10.1007\/BF00248324"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45620-1_31","volume-title":"Automated Deduction\u2014CADE-18","author":"LC Paulson","year":"2002","unstructured":"Paulson, L.C.: The reflection theorem: a study in meta-theoretic reasoning. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 377\u2013391. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45620-1_31"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1112\/S1461157000000449","volume":"6","author":"LC Paulson","year":"2003","unstructured":"Paulson, L.C.: The relative consistency of the axiom of choice\u2013mechanized using Isabelle\/ZF. LMS J. Comput. Math. 6, 198\u2013248 (2003). https:\/\/doi.org\/10.1112\/S1461157000000449","journal-title":"LMS J. Comput. Math."},{"key":"6_CR17","unstructured":"Paulson, L.C.: Zermelo Fraenkel set theory in higher-order logic. Arch. Formal Proofs, October 2019. http:\/\/isa-afp.org\/entries\/ZFC_in_HOL.html, formal proof development"},{"key":"6_CR18","unstructured":"Paulson, L.C.: Ordinal partitions. Archive of Formal Proofs, August 2020. http:\/\/isa-afp.org\/entries\/Ordinal_Partitions.html, Formal proof development"},{"key":"6_CR19","unstructured":"Paulson, L.C.: Wetzel\u2019s problem and the continuum hypothesis. Archive of Formal Proofs, February 2022. https:\/\/isa-afp.org\/entries\/Wetzels_Problem.html, Formal proof development"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF00283132","volume":"17","author":"LC Paulson","year":"1996","unstructured":"Paulson, L.C., Grabczewski, K.: Mechanizing set theory: cardinal arithmetic and the axiom of choice. J. Autom. Reasoning 17(3), 291\u2013323 (1996). https:\/\/doi.org\/10.1007\/BF00283132","journal-title":"J. Autom. Reasoning"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Schleicher, D., Stoll, M.: An introduction to Conway\u2019s games and numbers(2004). https:\/\/doi.org\/10.48550\/ARXIV.MATH\/0410026, https:\/\/arxiv.org\/abs\/math\/0410026","DOI":"10.48550\/ARXIV.MATH\/0410026"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0028402","volume-title":"Theorem Proving in Higher Order Logics","author":"M Wenzel","year":"1997","unstructured":"Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E.L., Felty, A. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 307\u2013322. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028402"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/BFb0014566","volume-title":"Theoretical Aspects of Computer Software","author":"B Werner","year":"1997","unstructured":"Werner, B.: Sets in types, types in sets. In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol. 1281, pp. 530\u2013546. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0014566"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16681-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:42:33Z","timestamp":1663299753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16681-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031166808","9783031166815"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16681-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2022\/cicm.php","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":"37","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":"4","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":"46% - 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.95","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.9","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)"}}]}}