{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:27:22Z","timestamp":1767652042902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030810962"},{"type":"electronic","value":"9783030810979"}],"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-81097-9_2","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:04:38Z","timestamp":1626735878000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Beautiful Formalizations in Isabelle\/Naproche"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2697-7253","authenticated-orcid":false,"given":"Adrian","family":"De Lon","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2266-134X","authenticated-orcid":false,"given":"Peter","family":"Koepke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3538-9688","authenticated-orcid":false,"given":"Anton","family":"Lorenzen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8932-8843","authenticated-orcid":false,"given":"Adrian","family":"Marti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5386-5134","authenticated-orcid":false,"given":"Marcel","family":"Sch\u00fctz","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Sturzenhecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"2_CR1","unstructured":"Cramer, M.: Proof-checking mathematical texts in controlled natural language. PhD thesis, University of Bonn (2013)"},{"key":"2_CR2","unstructured":"Eberl, M.: Furstenberg\u2019s topology and his proof of the infinitude of primes. Archive of Formal Proofs (March 2020). https:\/\/isa-afp.org\/entries\/Furstenberg_Topology.html"},{"key":"2_CR3","unstructured":"Frerix, S., Koepke, P.: Automatic proof-checking of ordinary mathematical texts. In: Proceedings of the Workshop Formal Mathematics for Mathematicians (2018)"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.2307\/2307043","volume":"62","author":"H Furstenberg","year":"1955","unstructured":"Furstenberg, H.: On the infinitude of primes. Am. Math. Monthly 62(5), 353 (1955)","journal-title":"Am. Math. Monthly"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Hersh, R.: What is Mathematics, Really?. Oxford University Press, Oxford (1997)","DOI":"10.1515\/dmvm-1998-0205"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1093\/philmat\/nku014","volume":"23","author":"M Inglis","year":"2014","unstructured":"Inglis, M., Aberdein, A.: Beauty is not simplicity: an analysis of mathematicians\u2019 proof appraisals. Philosophia Math. 23, 87\u2013109 (2014)","journal-title":"Philosophia Math."},{"key":"2_CR7","unstructured":"Isabelle contributors. The Isabelle 2021 release (February 2021)"},{"key":"2_CR8","first-page":"133","volume":"6","author":"B Knaster","year":"1928","unstructured":"Knaster, B., Tarski, A.: Un th\u00e9or\u00e8me sur les fonctions d\u2019ensembles. Annales de la Soci\u00e9t\u00e9 Polonaise de Math\u00e9matique 6, 133\u2013134 (1928)","journal-title":"Annales de la Soci\u00e9t\u00e9 Polonaise de Math\u00e9matique"},{"key":"2_CR9","unstructured":"Koepke, P.: Textbook mathematics in the Naproche-SAD system. In: Joint Proceedings of the FMM and LML Workshops (2019)"},{"key":"2_CR10","first-page":"177","volume":"60","author":"J K\u00f6nig","year":"1905","unstructured":"K\u00f6nig, J.: Mathematische Annalen. Zum Kontinuumsproblem 60, 177\u2013180 (1905)","journal-title":"Zum Kontinuumsproblem"},{"key":"2_CR11","unstructured":"K\u00fchlwein, D., Cramer, M., Koepke, P., Schr\u00f6der, B.: The Naproche system (2009)"},{"key":"2_CR12","unstructured":"Ziegler, G.M., Aigner, M.: Proofs from THE BOOK. 4th edition, Springer, Berlin (2009)"},{"key":"2_CR13","unstructured":"McAllister, J.W.: Mathematical beauty and the evolution of the standards of mathematical proof. In: Emmer, M. (ed) The Visual Mind II, pp. 15\u201334. MIT Press, Cambridge (2005)"},{"key":"2_CR14","unstructured":"Paskevich, A.: Furstenberg\u2019s proof in SAD (2008). http:\/\/nevidal.org\/cgi-bin\/sad.cgi?ty=txt&ln=en&link=fuerst.ftl"},{"key":"2_CR15","unstructured":"Paskevich, A.: M\u00e9thodes de formalisation des connaissances et des raisonnements math\u00e9matiques: aspects appliqu\u00e9s et th\u00e9oriques. PhD thesis, Universit\u00e9 Paris (12, 2007)"},{"key":"2_CR16","unstructured":"Paskevich, A.: The syntax and semantics of the ForTheL language (2007)"},{"key":"2_CR17","unstructured":"Paulson, L.C.: Alexandria: Large-scale formal proof for the working mathematician (2018)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1004930722234","volume":"111","author":"G-C Rota","year":"1997","unstructured":"Rota, G.-C.: The phenomenology of mathematical beauty. Synthese 111(2), 171\u2013182 (1997)","journal-title":"Synthese"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-73595-3_29","volume-title":"Automated Deduction \u2013 CADE-21","author":"K Verchinine","year":"2007","unstructured":"Verchinine, K., Lyaletski, A., Paskevich, A.: System for automated deduction (SAD): a tool for proof verification. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 398\u2013403. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_29"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-540-85110-3_47","volume-title":"Intelligent Computer Mathematics","author":"K Verchinine","year":"2008","unstructured":"Verchinine, K., Lyaletski, A., Paskevich, A., Anisimov, A.: On correctness of mathematical texts from a logical and practical point of view. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) CICM 2008. LNCS (LNAI), vol. 5144, pp. 583\u2013598. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85110-3_47"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF03024015","volume":"12","author":"D Wells","year":"1990","unstructured":"Wells, D.: Are these the most beautiful? Math. Intell. 12, 37\u201341 (1990)","journal-title":"Math. Intell."}],"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-030-81097-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:05:34Z","timestamp":1626735934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81097-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030810962","9783030810979"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81097-9_2","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":"20 July 2021","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":"Timisoara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","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":"26 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2021\/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":"38","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":"12","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":"8","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":"32% - 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,5","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)"}}]}}