{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T23:51:39Z","timestamp":1774396299423,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032206831","type":"print"},{"value":"9783032206848","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-20684-8_3","type":"book-chapter","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:07:50Z","timestamp":1773670070000},"page":"29-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fracterm Calculus for\u00a0Partial Meadows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2492-506X","authenticated-orcid":false,"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6061-5355","authenticated-orcid":false,"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Anderson, J.A.D.W., V\u00f6lker, N., Adams, A.A.: Perspex Machine VIII, axioms of transreal arithmetic. In: Latecki, J., Mount, D.M., Wu, A.Y. (eds.) Proc. SPIE 6499, Vision Geometry XV, 649902 (2007). https:\/\/doi.org\/10.1117\/12.698153","DOI":"10.1117\/12.698153"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Bethke, I., Rodenburg, P.H.: A propositional logic with 4 values: true, false, divergent and meaningless. J. Appl. Non-Class. Logics 5(2): 199\u2013217 (1995). https:\/\/doi.org\/10.1080\/11663081.1995.10510855 (also available as report P9406 at https:\/\/ivi.fnwi.uva.nl\/tcs\/publications.php)","DOI":"10.1080\/11663081.1995.10510855"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Broy, M., Tucker, J.V., Wirsing, M.: On the power of algebraic specifications. In: Gruska, J., Chytil, M. (eds.) Mathematical Foundations of Computer Science 1981 (MFCS 1981), LNCS, vol. 118, pp. 193\u2013204, Springer, Berlin, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10856-4_85","DOI":"10.1007\/3-540-10856-4_85"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Ponse, A.: Division by zero in common meadows. In De Nicola, R., Hennicker, R. (eds.) Software, Services, and Systems: Essays dedicated to Martin Wirsing. LNCS, vol. 8950, pp. 46\u201361, Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15545-6_6 Also available in improved form as arXiv:1406.6878v4 (22\u00a0March 2021). https:\/\/doi.org\/10.48550\/arXiv.1406.6878","DOI":"10.1007\/978-3-319-15545-6_6"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.indag.2016.01.007","volume":"27","author":"JA Bergstra","year":"2016","unstructured":"Bergstra, J.A., Ponse, A.: Fracpairs and fractions over a reduced commutative ring. Indigationes Mathematicae 27(3), 727\u2013748 (2016). https:\/\/doi.org\/10.1016\/j.indag.2016.01.007","journal-title":"Indigationes Mathematicae"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Ponse, A.: Conditional logic as a short-circuit logic. Sci. Ann. Comput. Sci. 35(2): 161\u2013196 (2025). https:\/\/doi.org\/10.47743\/SACS.2025.2.161","DOI":"10.47743\/SACS.2025.2.161"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Ponse, A.: Fracterm calculus for partial meadows. arXiv:2502.13812 (7\u00a0October 2025). https:\/\/doi.org\/10.48550\/arXiv.2502.13812","DOI":"10.48550\/arXiv.2502.13812"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Ponse, A., Staudt, D.J.C.: Short-circuit logic. arXiv:1010.3674v4 (12 March 2013). https:\/\/doi.org\/10.48550\/arXiv.1010.3674","DOI":"10.48550\/arXiv.1010.3674"},{"issue":"3\u20134","key":"3_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1080\/11663081.2021.2010954","volume":"31","author":"JA Bergstra","year":"2021","unstructured":"Bergstra, J.A., Ponse, A., Staudt, D.J.C.: Non-commutative propositional logic with short-circuit evaluation. J. Appl. Non-Classical Logics 31(3\u20134), 234\u2013278 (2021). https:\/\/doi.org\/10.1080\/11663081.2021.2010954","journal-title":"J. Appl. Non-Classical Logics"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Tucker, J.V.: The rational numbers as an abstract data type. J. ACM 54(2), Article 7, 25 pages (2007). https:\/\/doi.org\/10.1145\/1219092.1219095","DOI":"10.1145\/1219092.1219095"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Tucker, J.V.: Partial arithmetical data types of rational numbers and their equational specification. J. Logical Algeb. Methods Programm. 128, Article 100797, 16 (2022). https:\/\/doi.org\/10.1016\/j.jlamp.2022.100797","DOI":"10.1016\/j.jlamp.2022.100797"},{"issue":"7","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1093\/comjnl\/bxac026","volume":"66","author":"JA Bergstra","year":"2022","unstructured":"Bergstra, J.A., Tucker, J.V.: On the axioms of common meadows: fracterm calculus, flattening and incompleteness. Comput. J. 66(7), 1565\u20131572 (2022). https:\/\/doi.org\/10.1093\/comjnl\/bxac026","journal-title":"Comput. J."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Tucker, J.V.: On defining expressions for entropy and cross-entropy: the entropic transreals and their fracterm calculus. Entropy 27(1), Article 31, 13 (2025). https:\/\/doi.org\/10.3390\/e27010031","DOI":"10.3390\/e27010031"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0960129503004110","volume":"14","author":"J Carlstr\u00f6m","year":"2004","unstructured":"Carlstr\u00f6m, J.: Wheels - on division by zero. Math. Struct. Comput. Sci. 14(1), 143\u2013184 (2004). https:\/\/doi.org\/10.1017\/S0960129503004110","journal-title":"Math. Struct. Comput. Sci."},{"issue":"06","key":"3_CR15","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1142\/S0218196724500310","volume":"24","author":"J Dias","year":"2024","unstructured":"Dias, J., Dinis, B.: Towards an enumeration of finite common meadows. Internat. J. Algebra Comput. 24(06), 837\u2013855 (2024). https:\/\/doi.org\/10.1142\/S0218196724500310","journal-title":"Internat. J. Algebra Comput."},{"issue":"12","key":"3_CR16","doi-asserted-by":"publisher","first-page":"5015","DOI":"10.1080\/00927872.2024.2362932","volume":"52","author":"J Dias","year":"2024","unstructured":"Dias, J., Dinis, B.: Strolling through common meadows. Comm. Algebra 52(12), 5015\u20135042 (2024). https:\/\/doi.org\/10.1080\/00927872.2024.2362932","journal-title":"Comm. Algebra"},{"key":"3_CR17","unstructured":"Diertens, B.: PSF - Process Specification Formalism. https:\/\/bob.diertens.org\/cs\/psf\/. Accessed 24 Oct 2024"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01190256","volume":"27","author":"F Guzm\u00e1n","year":"1990","unstructured":"Guzm\u00e1n, F., Squier, C.C.: The algebra of conditional logic. Algebra Universalis 27, 88\u2013110 (1990). https:\/\/doi.org\/10.1007\/BF01190256","journal-title":"Algebra Universalis"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01178666","volume":"31","author":"CB Jones","year":"1994","unstructured":"Jones, C.B., Middelburg, C.A.: A typed logic of partial functions, reconstructed classically. Acta Informatica 31, 399\u2013430 (1994). https:\/\/doi.org\/10.1007\/BF01178666","journal-title":"Acta Informatica"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Konikowska, B., Tarlecki, A., Blikle, A.: A three-valued logic for software specification and validation: Tertium tamen datur. In: Bloomfield, R.E., Marshall, L.S., Jones, R.B. (eds.) VDM \u201988 VDM \u2013 The Way Ahead (VDM 1988). LNCS, vol. 328, pp. 218\u2013242, Springer, Berlin, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-50214-9_19","DOI":"10.1007\/3-540-50214-9_19"},{"key":"3_CR21","unstructured":"Mauw, S.: A constructive version of the approximation induction principle. In: Proceedings of the SION Conference on Computing Science in the Netherlands (CSN\u201987), pp. 235\u2013252, CWI, Amsterdam (1987)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Mauw, S., Veltink, G.J.: Algebraic specification of communication protocols. Cambridge Tracts in Theoretical Computer Science, vol. 36. Cambridge University Press, Cambridge (1993). https:\/\/doi.org\/10.1017\/CBO9780511721625","DOI":"10.1017\/CBO9780511721625"},{"key":"3_CR23","unstructured":"McCune, W.: The GUI: Prover9 and Mace4 with a graphical user interface. Prover9-Mace4 Version 0.5B. (Prover9-Mace4-v05B.zip, March 14, 2008). https:\/\/www.cs.unm.edu\/~mccune\/prover9\/gui\/v05.html, last accessed 2025\/11\/17"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/11663081.2018.1448637","volume":"28","author":"A Ponse","year":"2018","unstructured":"Ponse, A., Staudt, D.J.C.: An independent axiomatisation for free short-circuit logic. J. Appl. Non-Classical Logics 28(1), 35\u201371 (2018). https:\/\/doi.org\/10.1080\/11663081.2018.1448637","journal-title":"J. Appl. Non-Classical Logics"},{"key":"3_CR25","unstructured":"dos Reis, T.S., Gomide, W., Anderson, J.A.D.W.: Construction of the transreal numbers and algebraic transfields. IAENG Int. J. Appl. Math. 46(1): 11\u201323 (2016). https:\/\/www.iaeng.org\/IJAM\/issues_v46\/issue_1\/IJAM_46_1_03.pdf"}],"container-title":["Lecture Notes in Computer Science","Juggling Formal Methods and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20684-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T23:02:16Z","timestamp":1774393336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20684-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032206831","9783032206848"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20684-8_3","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":"17 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}}]}}