{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:07:32Z","timestamp":1743008852741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031427527"},{"type":"electronic","value":"9783031427534"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42753-4_1","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large-Scale Formal Proof for\u00a0the\u00a0Working Mathematician\u2014Lessons Learnt from\u00a0the\u00a0ALEXANDRIA Project"],"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":[[2023,8,28]]},"reference":[{"key":"1_CR1","unstructured":"Boolos, G.S.: Saving Frege from contradiction. In: Logic, Logic, and Logic, pp. 171\u2013182. Harvard University Press (1998)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Bordg, A., Do\u00f1a Mateo, A.: Encoding dependently-typed constructions into simple type theory. In: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2023, pp. 78\u201389. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3573105.3575679","DOI":"10.1145\/3573105.3575679"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1080\/10586458.2022.2062073","volume":"31","author":"A Bordg","year":"2022","unstructured":"Bordg, A., Paulson, L., Li, W.: Simple type theory is not too simple: Grothendieck\u2019s schemes without dependent types. Exp. Math. 31(2), 364\u2013382 (2022). https:\/\/doi.org\/10.1080\/10586458.2022.2062073","journal-title":"Exp. Math."},{"key":"1_CR4","unstructured":"de Bruijn, N.G.: AUTOMATH, a language for mathematics. Tech. Rep. 68-WSK-05, Technical University Eindhoven (Nov 1968)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"de Bruijn, N.G.: The mathematical language AUTOMATH, its usage, and some of its extensions. In: Laudet, M. (ed.) Proceedings of the Symposium on Automatic Demonstration, pp. 29\u201361. Springer LNM 125, Versailles, France (Dec 1968)","DOI":"10.1007\/BFb0060623"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Buzzard, K., Hughes, C., Lau, K., Livingston, A., Mir, R.F., Morrison, S.: Schemes in lean. Experim. Math. 31(2), 355\u2013363 (2022). https:\/\/doi.org\/10.1080\/10586458.2021.1983489","DOI":"10.1080\/10586458.2021.1983489"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1038\/d41586-021-01627-2","volume":"595","author":"D Castelvecchi","year":"2021","unstructured":"Castelvecchi, D.: Mathematicians welcome computer-assisted proof in \u2018grand unification\u2019 theory. Nature 595, 18\u201319 (2021)","journal-title":"Nature"},{"key":"1_CR8","unstructured":"Dillies, Y., Mehta, B.: Formalizing Szemer\u00e9di\u2019s regularity lemma in Lean. In: Andronick, J., de Moura, L. (eds.) 13th International Conference on Interactive Theorem Proving, pp. 9:1\u20139:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/10586458.2021.1980464","volume":"31","author":"M D\u017eamonja","year":"2022","unstructured":"D\u017eamonja, M., Koutsoukou-Argyraki, A., Paulson, L.C.: Formalising ordinal partition relations using Isabelle\/HOL. Exp. Math. 31(2), 383\u2013400 (2022). https:\/\/doi.org\/10.1080\/10586458.2021.1980464","journal-title":"Exp. Math."},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Edmonds, C., Koutsoukou-Argyraki, A., Paulson, L.C.: Formalising Szemer\u00e9di\u2019s regularity lemma and Roth\u2019s theorem on arithmetic progressions in Isabelle\/HOL. J. Autom. Reasoning 67(1) (2023), https:\/\/doi.org\/10.1007\/s10817-022-09650-2","DOI":"10.1007\/s10817-022-09650-2"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-81097-9_1","volume-title":"Intelligent Computer Mathematics","author":"C Edmonds","year":"2021","unstructured":"Edmonds, C., Paulson, L.C.: A modular first formalisation of combinatorial design theory. In: Kamareddine, F., Sacerdoti Coen, C. (eds.) CICM 2021. LNCS (LNAI), vol. 12833, pp. 3\u201318. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81097-9_1"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Edmonds, C., Paulson, L.C.: Formalising Fisher\u2019s inequality: formal linear algebraic proof techniques in combinatorics. In: Andronick, J., de Moura, L. (eds.) 13th International Conference on Interactive Theorem Proving (ITP 2022), vol. 237, pp. 11:1\u201311:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2022.11","DOI":"10.4230\/LIPIcs.ITP.2022.11"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Straus, E.G.: On the irrationality of certain series. Pacific J. Math. 55(1), 85\u201392 (1974). https:\/\/doi.org\/pjm\/1102911140","DOI":"10.2140\/pjm.1974.55.85"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.4153\/CMB-1972-088-1","volume":"15","author":"P Erd\u0151s","year":"1972","unstructured":"Erd\u0151s, P., Milner, E.C.: A theorem in the partition calculus. Can. Math. Bull. 15(4), 501\u2013505 (1972). https:\/\/doi.org\/10.4153\/CMB-1972-088-1","journal-title":"Can. Math. Bull."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.4153\/CMB-1974-062-6","volume":"17","author":"P Erd\u0151s","year":"1974","unstructured":"Erd\u0151s, P., Milner, E.C.: A theorem in the partition calculus corrigendum. Can. Math. Bull. 17(2), 305 (1974). https:\/\/doi.org\/10.4153\/CMB-1974-062-6","journal-title":"Can. Math. Bull."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87827-8_28","volume-title":"Computer Mathematics","author":"G Gonthier","year":"2008","unstructured":"Gonthier, G.: The four colour theorem: engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol. 5081, pp. 333\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87827-8_28"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-39634-2_14","volume-title":"Interactive Theorem Proving","author":"G Gonthier","year":"2013","unstructured":"Gonthier, G., et al.: A machine-checked proof of the odd order theorem. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 163\u2013179. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39634-2_14"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Grabowski, A., Korni\u0142owicz, A., Naumowicz, A.: Four decades of Mizar. J. Autom. Reasoning 55(3), 191\u2013198 (Oct 2015). https:\/\/doi.org\/10.1007\/s10817-015-9345-1","DOI":"10.1007\/s10817-015-9345-1"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/fmp.2017.1","volume":"5","author":"T Hales","year":"2017","unstructured":"Hales, T., et al.: A formal proof of the Kepler conjecture. Forum Math. Pi 5, e2 (2017). https:\/\/doi.org\/10.1017\/fmp.2017.1","journal-title":"Forum Math. Pi"},{"key":"1_CR20","unstructured":"Han\u010dl, J.: Irrational rapidly convergent series. Rendiconti del Seminario Matematico della Universit\u00e0 di Padova 107, 225\u2013231 (2002). http:\/\/eudml.org\/doc\/108582"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1216\/rmjm\/1181069744","volume":"35","author":"J Han\u010dl","year":"2005","unstructured":"Han\u010dl, J., Rucki, P.: The transcendence of certain infinite series. Rocky Mountain J. Math. 35(2), 531\u2013537 (2005). https:\/\/doi.org\/10.1216\/rmjm\/1181069744","journal-title":"Rocky Mountain J. Math."},{"key":"1_CR22","unstructured":"Jiang, A.Q., et al.: Thor: Wielding hammers to integrate language models and automated theorem provers. In: Neural Information Processing Systems (NeurIPS) (2022)"},{"key":"1_CR23","unstructured":"Jiang, A.Q., et al.: Draft, sketch, and prove: guiding formal theorem provers with informal proofs. In: Eleventh International Conference on Learning Representations (2023). https:\/\/openreview.net\/forum?id=SMa9EAovKMC"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Jutting, L.: Checking Landau\u2019s \u201cGrundlagen\u201d in the AUTOMATH System. Ph.D. thesis, Eindhoven University of Technology (1977). https:\/\/doi.org\/10.6100\/IR23183","DOI":"10.6100\/IR23183"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Koutsoukou-Argyraki, A.: Formalising mathematics \u2014 in praxis; a mathematician\u2019s first experiences with Isabelle\/HOL and the why and how of getting started. Jahresbericht der Deutschen Mathematiker-Vereinigung 123(1), 3\u201326 (2021). https:\/\/doi.org\/10.1365\/s13291-020-00221-1","DOI":"10.1365\/s13291-020-00221-1"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Koutsoukou-Argyraki, A., Bak\u0161ys, M., Edmonds, C.: A formalisation of the Balog-Szemer\u00e9di-Gowers theorem in Isabelle\/HOL. In: 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2023, pp. 225\u2013238. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3573105.3575680","DOI":"10.1145\/3573105.3575680"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/10586458.2021.1980465","volume":"31","author":"A Koutsoukou-Argyraki","year":"2022","unstructured":"Koutsoukou-Argyraki, A., Li, W., Paulson, L.C.: Irrationality and transcendence criteria for infinite series in Isabelle\/HOL. Exp. Math. 31(2), 401\u2013412 (2022)","journal-title":"Exp. Math."},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Kun\u010dar, O., Popescu, A.: From types to sets by local type definition in higher-order logic. J. Autom. Reasoning 62(2), 237\u2013260 (2019). https:\/\/doi.org\/10.1007\/s10817-018-9464-6","DOI":"10.1007\/s10817-018-9464-6"},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0003-4843(73)90006-5","volume":"6","author":"JA Larson","year":"1973","unstructured":"Larson, J.A.: A short proof of a partition theorem for the ordinal $$\\omega ^\\omega $$. Annals Math. Logic 6(2), 129\u2013145 (1973). https:\/\/doi.org\/10.1016\/0003-4843(73)90006-5","journal-title":"Annals Math. Logic"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Li, W., Paulson, L.C.: Counting polynomial roots in Isabelle\/HOL: a formal proof of the Budan-Fourier theorem. In: 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2019, pp. 52\u201364. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3293880.3294092","DOI":"10.1145\/3293880.3294092"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Li, W., Paulson, L.C.: Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle\/HOL. J. Autom. Reasoning (Apr 2019). https:\/\/doi.org\/10.1007\/s10817-019-09521-3","DOI":"10.1007\/s10817-019-09521-3"},{"key":"1_CR32","unstructured":"Li, W., Yu, L., Wu, Y., Paulson, L.C.: Isarstep: a benchmark for high-level mathematical reasoning. In: 9th International Conference on Learning Representations, ICLR 2021. OpenReview.net (2021). https:\/\/openreview.net\/forum?id=Pzj6fzU6wkj"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Paulson, L.C.: Wetzel: formalisation of an undecidable problem linked to the continuum hypothesis. In: Intelligent Computer Mathematics: 15th International Conference, CICM 2022, pp. 92\u2013106. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-16681-5_6","DOI":"10.1007\/978-3-031-16681-5_6"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51074-9","volume-title":"Automated Reasoning","year":"2020","unstructured":"Peltier, N., Sofronie-Stokkermans, V. (eds.): IJCAR 2020. LNCS (LNAI), vol. 12166. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9"},{"key":"1_CR35","unstructured":"Stathopoulos, Y., Koutsoukou-Argyraki, A., Paulson, L.: Developing a concept-oriented search engine for Isabelle based on natural language: technical challenges. In: 5th Conference on Artificial Intelligence and Theorem Proving (2020). http:\/\/aitp-conference.org\/2020\/abstract\/paper_9.pdf"},{"key":"1_CR36","unstructured":"Todor\u010devi\u0107, S.: Introduction to Ramsey Spaces. Princeton University Press (2010)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"de Vilhena, P.E., Paulson, L.C.: Algebraically closed fields in Isabelle\/HOL. In: Peltier and Sofronie-Stokkermans [34], pp. 204\u2013220","DOI":"10.1007\/978-3-030-51054-1_12"},{"key":"1_CR38","unstructured":"Voevodsky, V.: The origins and motivations of univalent foundations. The Institute Letter, pp. 8\u20139 (Summer 2014). https:\/\/www.ias.edu\/ideas\/2014\/voevodsky-origins"},{"issue":"1","key":"1_CR39","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1147\/rd.41.0002","volume":"4","author":"H Wang","year":"1960","unstructured":"Wang, H.: Toward mechanical mathematics. IBM J. Res. Dev. 4(1), 2\u201322 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"1_CR40","unstructured":"Whitehead, A.N., Russell, B.: Principia Mathematica. Cambridge University Press (1962), paperback edition to *56, abridged from the 2nd edition (1927)"},{"key":"1_CR41","unstructured":"Wu, Y., et al.: Autoformalization with large language models. In: Neural Information Processing Systems (NeurIPS) (2022)"}],"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-42753-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:48Z","timestamp":1693375368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","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":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/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":"31","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":"16","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":"52% - 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)"}}]}}