No Cover Image

Journal article 50 views

Logical models of mathematical texts: the case of conventions for division by zero

John Tucker Orcid Logo, Jan Bergstra

Journal of Logic, Language and Information

Swansea University Author: John Tucker Orcid Logo

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1007/s10849-024-09420-w

Abstract

Arithmetical texts involving division are governed by conventions that avoid the risk of problems to do with division by zero (DbZ). A model for elementary arithmetic texts is given, and with the help of many examples and counter examples a partial description of what may be called traditional conve...

Full description

Published in: Journal of Logic, Language and Information
Published: Springer
URI: https://cronfa.swan.ac.uk/Record/cronfa66861
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2024-07-03T09:08:03Z
last_indexed 2024-07-03T09:08:03Z
id cronfa66861
recordtype SURis
fullrecord <?xml version="1.0" encoding="utf-8"?><rfc1807 xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"><bib-version>v2</bib-version><id>66861</id><entry>2024-06-23</entry><title>Logical models of mathematical texts: the case of conventions for division by zero</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>2024-06-23</date><deptcode>MACS</deptcode><abstract>Arithmetical texts involving division are governed by conventions that avoid the risk of problems to do with division by zero (DbZ). A model for elementary arithmetic texts is given, and with the help of many examples and counter examples a partial description of what may be called traditional conventions on DbZ is explored. We introduce the informal notions of legal and illegal texts to analyse these conventions. First, we show that the legality of a text is algorithmically undecidable. As a consequence, we know that there is no simple sound and complete set of guidelines to determine unambiguously how DbZ is to be avoided. We argue that these observations call for further explorations of mathematical conventions. We propose a method using logics to progress the analysis of legality versus illegality: arithmetical texts in a model can be transformed into logical formulae over special total algebras that are able to approximate partiality but in a total world. The algebras we use are called common meadows. This deep dive into informal mathematical practice using formal methods opens up questions about DbZ which we address in conclusion.</abstract><type>Journal Article</type><journal>Journal of Logic, Language and Information</journal><volume/><journalNumber/><paginationStart/><paginationEnd/><publisher>Springer</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint/><issnElectronic/><keywords>division by zero; arithmetic; traditional conventions for writing mathematics; legal texts; illegal texts; undecidability; common meadows</keywords><publishedDay>0</publishedDay><publishedMonth>0</publishedMonth><publishedYear>0</publishedYear><publishedDate>0001-01-01</publishedDate><doi>10.1007/s10849-024-09420-w</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>2024-07-06T18:50:34.9415566</lastEdited><Created>2024-06-23T18:12:30.7582055</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>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>1</order></author><author><firstname>Jan</firstname><surname>Bergstra</surname><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling v2 66861 2024-06-23 Logical models of mathematical texts: the case of conventions for division by zero 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2024-06-23 MACS Arithmetical texts involving division are governed by conventions that avoid the risk of problems to do with division by zero (DbZ). A model for elementary arithmetic texts is given, and with the help of many examples and counter examples a partial description of what may be called traditional conventions on DbZ is explored. We introduce the informal notions of legal and illegal texts to analyse these conventions. First, we show that the legality of a text is algorithmically undecidable. As a consequence, we know that there is no simple sound and complete set of guidelines to determine unambiguously how DbZ is to be avoided. We argue that these observations call for further explorations of mathematical conventions. We propose a method using logics to progress the analysis of legality versus illegality: arithmetical texts in a model can be transformed into logical formulae over special total algebras that are able to approximate partiality but in a total world. The algebras we use are called common meadows. This deep dive into informal mathematical practice using formal methods opens up questions about DbZ which we address in conclusion. Journal Article Journal of Logic, Language and Information Springer division by zero; arithmetic; traditional conventions for writing mathematics; legal texts; illegal texts; undecidability; common meadows 0 0 0 0001-01-01 10.1007/s10849-024-09420-w COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University SU Library paid the OA fee (TA Institutional Deal) Swansea University 2024-07-06T18:50:34.9415566 2024-06-23T18:12:30.7582055 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science John Tucker 0000-0003-4689-8760 1 Jan Bergstra 2
title Logical models of mathematical texts: the case of conventions for division by zero
spellingShingle Logical models of mathematical texts: the case of conventions for division by zero
John Tucker
title_short Logical models of mathematical texts: the case of conventions for division by zero
title_full Logical models of mathematical texts: the case of conventions for division by zero
title_fullStr Logical models of mathematical texts: the case of conventions for division by zero
title_full_unstemmed Logical models of mathematical texts: the case of conventions for division by zero
title_sort Logical models of mathematical texts: the case of conventions for division by zero
author_id_str_mv 431b3060563ed44cc68c7056ece2f85e
author_id_fullname_str_mv 431b3060563ed44cc68c7056ece2f85e_***_John Tucker
author John Tucker
author2 John Tucker
Jan Bergstra
format Journal article
container_title Journal of Logic, Language and Information
institution Swansea University
doi_str_mv 10.1007/s10849-024-09420-w
publisher Springer
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 0
active_str 0
description Arithmetical texts involving division are governed by conventions that avoid the risk of problems to do with division by zero (DbZ). A model for elementary arithmetic texts is given, and with the help of many examples and counter examples a partial description of what may be called traditional conventions on DbZ is explored. We introduce the informal notions of legal and illegal texts to analyse these conventions. First, we show that the legality of a text is algorithmically undecidable. As a consequence, we know that there is no simple sound and complete set of guidelines to determine unambiguously how DbZ is to be avoided. We argue that these observations call for further explorations of mathematical conventions. We propose a method using logics to progress the analysis of legality versus illegality: arithmetical texts in a model can be transformed into logical formulae over special total algebras that are able to approximate partiality but in a total world. The algebras we use are called common meadows. This deep dive into informal mathematical practice using formal methods opens up questions about DbZ which we address in conclusion.
published_date 0001-01-01T18:50:33Z
_version_ 1803852954500857856
score 11.017731

Similar Items