EUVIMEDOpdag EUVIMED
Open access · CC BY-SA 4.0

Totalising Partial Algebras

Jan Aldert Bergstra, John V. Tucker

Transmathematica · 2022

DOI: 10.36285/tm.57 ↗

At a glance

Journal article in Transmathematica, 2022. Written by Jan Aldert Bergstra and 1 co-authors. Cited 8 times so far (Crossref). The full text is freely available (open access, CC BY-SA 4.0).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

We will examine totalising a partial operation in a general algebra by using an absorbtive element, bottom, such as an error flag. We then focus on the simplest example of a partial operation, namely subtraction on the natural numbers: n - m is undefined whenever n < m. We examine the use of bottom in algebraic structures for the natural numbers, especially semigroups and semirings. We axiomatise this totalisation process and introduce the algebraic concept of a team, being an additive cancellative semigroup with totalised subtraction. Also, with the natural numbers in mind, we introduce the property of being generated by an iterative function, which we call a splinter. We prove a number of theorems about the algebraic specification of datatypes of natural numbers.

Cite

APA

Bergstra, J. A., & Tucker, J. V. (2022). Totalising Partial Algebras. Transmathematica. https://doi.org/10.36285/tm.57

Vancouver

Bergstra JA, Tucker JV. Totalising Partial Algebras. Transmathematica. 2022. doi:10.36285/tm.57

BibTeX
@article{Bergstra2022,
  author = {Bergstra, Jan Aldert and Tucker, John V.},
  title = {Totalising Partial Algebras},
  journal = {Transmathematica},
  year = {2022},
  doi = {10.36285/tm.57}
}
Start for free →