No Cover Image

Journal article 344 views 86 downloads

Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts

Jan A. Bergstra, John Tucker Orcid Logo

Journal of Logic, Language and Information

Swansea University Author: John Tucker Orcid Logo

  • 69593.VOR.pdf

    PDF | Version of Record

    © The Author(s) 2025. This article is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).

    Download (392.98KB)

Abstract

To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse si...

Full description

Published in: Journal of Logic, Language and Information
ISSN: 0925-8531 1572-9583
Published: Springer Nature 2025
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa69593
first_indexed 2025-05-30T10:38:28Z
last_indexed 2025-08-02T04:59:59Z
id cronfa69593
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2025-08-01T14:25:13.5612146</datestamp><bib-version>v2</bib-version><id>69593</id><entry>2025-05-30</entry><title>Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts</title><swanseaauthors><author><sid>431b3060563ed44cc68c7056ece2f85e</sid><ORCID>0000-0003-4689-8760</ORCID><firstname>John</firstname><surname>Tucker</surname><name>John Tucker</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2025-05-30</date><deptcode>MACS</deptcode><abstract>To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse simple fragments of arithmetical texts. We showed how these texts can be transformed into logical formulae over special total algebras, called common meadows, that are able to approximate partiality but in a total world. The subtleties of the legal/illegal distinction call for further development of these mathematical methods. Here we examine a more complex type of text, namely proof by contradiction, in which inconsistent assumptions can coexist with DbZ. We formulate more advanced criteria of legality for this case. We introduce a three-valued logic to capture the resulting semiformal conventions that is based on a notion we call frugal equality for partial operators. We apply the method to a proof of the Bayes-Price Theorem in probability theory, whose proof has DbZ issues.</abstract><type>Journal Article</type><journal>Journal of Logic, Language and Information</journal><volume>0</volume><journalNumber/><paginationStart/><paginationEnd/><publisher>Springer Nature</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0925-8531</issnPrint><issnElectronic>1572-9583</issnElectronic><keywords>Division by zero; Traditional conventions for writing arithmetic; Legal texts; Illegal texts; Proof by contradiction; Bayes-Price Theorem; Common meadows; Signed common meadows</keywords><publishedDay>20</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2025</publishedYear><publishedDate>2025-06-20</publishedDate><doi>10.1007/s10849-025-09438-8</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm>SU Library paid the OA fee (TA Institutional Deal)</apcterm><funders>Swansea University</funders><projectreference/><lastEdited>2025-08-01T14:25:13.5612146</lastEdited><Created>2025-05-30T11:36:31.2277430</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Jan A.</firstname><surname>Bergstra</surname><order>1</order></author><author><firstname>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>2</order></author></authors><documents><document><filename>69593__34562__41ec5abeb7e6499abf870ccc85977e8c.pdf</filename><originalFilename>69593.VOR.pdf</originalFilename><uploaded>2025-06-24T14:35:08.8738274</uploaded><type>Output</type><contentLength>402411</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>&#xA9; The Author(s) 2025. This article is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>http://creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807>
spelling 2025-08-01T14:25:13.5612146 v2 69593 2025-05-30 Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2025-05-30 MACS To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse simple fragments of arithmetical texts. We showed how these texts can be transformed into logical formulae over special total algebras, called common meadows, that are able to approximate partiality but in a total world. The subtleties of the legal/illegal distinction call for further development of these mathematical methods. Here we examine a more complex type of text, namely proof by contradiction, in which inconsistent assumptions can coexist with DbZ. We formulate more advanced criteria of legality for this case. We introduce a three-valued logic to capture the resulting semiformal conventions that is based on a notion we call frugal equality for partial operators. We apply the method to a proof of the Bayes-Price Theorem in probability theory, whose proof has DbZ issues. Journal Article Journal of Logic, Language and Information 0 Springer Nature 0925-8531 1572-9583 Division by zero; Traditional conventions for writing arithmetic; Legal texts; Illegal texts; Proof by contradiction; Bayes-Price Theorem; Common meadows; Signed common meadows 20 6 2025 2025-06-20 10.1007/s10849-025-09438-8 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University SU Library paid the OA fee (TA Institutional Deal) Swansea University 2025-08-01T14:25:13.5612146 2025-05-30T11:36:31.2277430 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Jan A. Bergstra 1 John Tucker 0000-0003-4689-8760 2 69593__34562__41ec5abeb7e6499abf870ccc85977e8c.pdf 69593.VOR.pdf 2025-06-24T14:35:08.8738274 Output 402411 application/pdf Version of Record true © The Author(s) 2025. This article is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). true eng http://creativecommons.org/licenses/by/4.0/
title Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
spellingShingle Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
John Tucker
title_short Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
title_full Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
title_fullStr Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
title_full_unstemmed Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
title_sort Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts
author_id_str_mv 431b3060563ed44cc68c7056ece2f85e
author_id_fullname_str_mv 431b3060563ed44cc68c7056ece2f85e_***_John Tucker
author John Tucker
author2 Jan A. Bergstra
John Tucker
format Journal article
container_title Journal of Logic, Language and Information
container_volume 0
publishDate 2025
institution Swansea University
issn 0925-8531
1572-9583
doi_str_mv 10.1007/s10849-025-09438-8
publisher Springer Nature
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description To avoid the risk of problems to do with division by zero (DbZ), arithmetical texts involving division use what may be called traditional conventions on DbZ. Earlier, we developed a method for exploring these conventions using informal notions of legal and illegal texts, which are used to analyse simple fragments of arithmetical texts. We showed how these texts can be transformed into logical formulae over special total algebras, called common meadows, that are able to approximate partiality but in a total world. The subtleties of the legal/illegal distinction call for further development of these mathematical methods. Here we examine a more complex type of text, namely proof by contradiction, in which inconsistent assumptions can coexist with DbZ. We formulate more advanced criteria of legality for this case. We introduce a three-valued logic to capture the resulting semiformal conventions that is based on a notion we call frugal equality for partial operators. We apply the method to a proof of the Bayes-Price Theorem in probability theory, whose proof has DbZ issues.
published_date 2025-06-20T05:28:36Z
_version_ 1851097892192780288
score 11.444473