{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T10:48:23Z","timestamp":1776509303061,"version":"3.51.2"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070203","type":"print"},{"value":"9783032070210","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07021-0_9","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T13:41:15Z","timestamp":1759844475000},"page":"152-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Flexible Boolean Semantics for the Language of Mathematics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4519-3689","authenticated-orcid":false,"given":"Shashank","family":"Pathak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Cramer, M.: Implicit dynamic function introduction and its connections to the foundations of mathematics. In: O.\u00a0Prosorov (ed.) Proceedings of the International Conference Philosophy, Mathematics, Linguistics: Aspects of Interaction, 2012 (PhML-2012), pp. 23\u201334. College Publications (2012)"},{"key":"9_CR2","unstructured":"Cramer, M., K\u00fchlwein, D., Schr\u00f6der, B.: Presupposition projection and accommodation in mathematical texts. In: M.\u00a0Pinkal, I.\u00a0Rehbein, S.\u00a0Schulte\u00a0im Walde, A.\u00a0Storrer (eds.) Semantic Approaches in Natural Language Processing: Proceedings of the 10th Conference on Natural Language Processing, KONVENS 2010, September 6-8, 2010, Saarland University, Saarbr\u00fccken, Germany, pp. 29\u201336. universaar, Universit\u00e4tsverlag des Saarlandes \/ Saarland University Press \/ Presses universitaires de la Sarre (2010)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Cramer, M., Schr\u00f6der, B.: Interpreting plurals in the Naproche CNL. In: M.\u00a0Rosner, N.E. Fuchs (eds.) Controlled Natural Language, pp. 43\u201352. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)","DOI":"10.1007\/978-3-642-31175-8_3"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ganesalingam, M.: The Language of Mathematics: A Linguistic and Philosophical Investigation, chap. The Language of Mathematics, pp. 17\u201338. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37012-0_2","DOI":"10.1007\/978-3-642-37012-0_2"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Hammer, H., Noda, N., Stone, C.A.: Prooflang: The language of arxiv proofs. In: C.\u00a0Dubois, M.\u00a0Kerber (eds.) Intelligent Computer Mathematics, pp. 285\u2013290. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-42753-4_19"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Heim, I.: 41. definiteness and indefiniteness. In: K.\u00a0von Heusinger, C.\u00a0Maienborn, P.\u00a0Portner (eds.) Volume 2, pp. 996\u20131025. De Gruyter Mouton, Berlin, Boston (2012). https:\/\/doi.org\/10.1515\/9783110255072.996","DOI":"10.1515\/9783110255072.996"},{"key":"9_CR7","unstructured":"Hodges, W.: Modality in mathematics. Logique et Analyse 56(221), 5\u201323 (2013). URL http:\/\/www.jstor.org\/stable\/44085245"},{"key":"9_CR8","unstructured":"Kamp, H., Reyle, U.: From Discourse to Logic: Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Link, G.: The logical analysis of plurals and mass terms: A lattice-theoretical approach. In: R.\u00a0B\u00e4uerle, C.\u00a0Schwarze, A.\u00a0von Stechow (eds.) Meaning, Use, and Interpretation of Language, pp. 302\u2013323. De Gruyter, Berlin, Boston (1983). https:\/\/doi.org\/10.1515\/9783110852820.302","DOI":"10.1515\/9783110852820.302"},{"key":"9_CR10","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.M.: Programming in Martin-L\u00f6f\u2019s type theory. Oxford University Press Oxford (1990)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Partee, B., Rooth, M.: Generalized conjunction and type ambiguity. In: R.\u00a0B\u00e4uerle, C.\u00a0Schwarze, A.\u00a0von Stechow (eds.) Meaning, Use, and Interpretation of Language, pp. 361\u2013383. De Gruyter, Berlin, Boston (1983). https:\/\/doi.org\/10.1515\/9783110852820.361","DOI":"10.1515\/9783110852820.361"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Partee, B.H.: Noun phrase interpretation and type-shifting principles. In: J.\u00a0Groenendijk, D.\u00a0de\u00a0Jongh, M.\u00a0Stokhof (eds.) Studies in Discourse Representation Theory and the Theory of Generalized Quantifiers, pp. 115\u2013144. De Gruyter, Berlin, Boston (1986). https:\/\/doi.org\/10.1515\/9783112420027-006","DOI":"10.1515\/9783112420027-006"},{"key":"9_CR13","unstructured":"Pathak, S.: Implementation of flexible boolean semantics (2025). URL https:\/\/github.com\/pkshashank\/Winter. Accessed: 22 April 2025"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Ranta, A.: Type theory and the informal language of mathematics. In: H.\u00a0Barendregt, T.\u00a0Nipkow (eds.) Types for Proofs and Programs, pp. 352\u2013365. Springer Berlin Heidelberg, Berlin, Heidelberg (1994)","DOI":"10.1007\/3-540-58085-9_84"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Ranta, A.: Syntactic categories in the language of mathematics. In: P.\u00a0Dybjer, B.\u00a0Nordstr\u00f6m, J.\u00a0Smith (eds.) Types for Proofs and Programs, pp. 162\u2013182. Springer Berlin Heidelberg, Berlin, Heidelberg (1995)","DOI":"10.1007\/3-540-60579-7_9"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Ranta, A.: Context-relative syntactic categories and the formalization of mathematical text. In: S.\u00a0Berardi, M.\u00a0Coppo (eds.) Types for Proofs and Programs, pp. 231\u2013248. Springer Berlin Heidelberg, Berlin, Heidelberg (1996)","DOI":"10.1007\/3-540-61780-9_73"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Ranta, A.: Grammatical framework. Journal of Functional Programming 14(2), 145\u2013189 (2004). https:\/\/doi.org\/10.1017\/S0956796803004738","DOI":"10.1017\/S0956796803004738"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Ranta, A.: Translating between language and logic: What is easy and what is difficult. In: N.\u00a0Bj\u00f8rner, V.\u00a0Sofronie-Stokkermans (eds.) Automated Deduction \u2013 CADE-23, pp. 5\u201325. Springer Berlin Heidelberg, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22438-6_3"},{"key":"9_CR19","unstructured":"Sch\u00e4fer, J.F., Kohlhase, M.: Syntactic\/semantic analysis for high-precision math linguistics. In: Joint 2018 Computer Mathematics in Education - Enlightenment or Incantation, CME-EI 2018, Formal Mathematics for Mathematicians, FMM 2018, Computer Algebra in the Age of Types, CAAT 2018, Formal Verification of Physical Systems, FVPS 2018, Mathematical Models and Mathematical Software as Research Data 2018, M3SRD 2018 and 29th OpenMath Workshops, Doctoral Program and Work in Progress at the Conference on Intelligent Computer Mathematics, CICM-WS 2018, vol. 2307. CEUR-WS (2018)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Sharvy, R.: A more general theory of definite descriptions. The Philosophical Review 89(4), 607\u2013624 (1980). URL http:\/\/www.jstor.org\/stable\/2184738","DOI":"10.2307\/2184738"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Tanswell, F.S., Inglis, M.: The language of proofs: A philosophical corpus linguistics study of instructions and imperatives in mathematical texts. In: B.\u00a0Sriraman (ed.) Handbook of the History and Philosophy of Mathematical Practice, pp. 1\u201328. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-19071-2_50-1","DOI":"10.1007\/978-3-030-19071-2_50-1"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Winter, Y.: Flexibility Principles in Boolean Semantics: The Interpretation of Coordination, Plurality, and Scope in Natural Language. The MIT Press (2002). https:\/\/doi.org\/10.7551\/mitpress\/3034.001.0001","DOI":"10.7551\/mitpress\/3034.001.0001"},{"key":"9_CR23","unstructured":"Zinn, C.: Understanding informal mathematical discourse. Ph.D. thesis, University of Erlangen-Nuremberg (2004). URL https:\/\/d-nb.info\/974113808"}],"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-032-07021-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T10:22:09Z","timestamp":1776507729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07021-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070203","9783032070210"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07021-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"The author has no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Brasilia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2025\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}