Errors, Failures, and Faults in the Context of Elementary Arithmetic
DOI:
https://doi.org/10.36285/tm.101Abstract
It is argued that setting one over zero to the upthorn symbol, elsewhere used to denote bottom, as is done in common meadows, is conceptually meaningful for elementary mathematics. We consider the arguments in its favour, for the restricted context of use in elementary arithmetic, to be stronger than arguments supporting one over zero equals zero, as in Suppes-Ono division and variants of it sometimes used in the model theory of fields as a branch of mathematical logic, or one over zero as an unsigned infinity, as proposed by Riemann and used in the design of wheel arithmetic, or one over zero as positive infinity, as in transrational arithmetic.
References
J. A. Anderson, N. Völker, and A. A. Adams. 2007. Perspecx Machine VIII, axioms of transreal arithmetic. In J. Latecki, D. M. Mount and A. Y. Wu (eds), Proc. SPIE 6499. Vision Geometry XV, 649902, 2007.
J.A. Anderson and J.A. Bergstra. Review of Suppes 1957 proposals for division by zero. Transmathematica. ISSN 2632-9212 (published 06-08-2021), (2021).
J.A. Bergstra. Arithmetical datatypes, fracterms, and the fraction definition problem. Transmathematica, ISSN 2632-9212, (published 2020-04-30), (2020).
J.A. Bergstra. Fractions in transrational arithmetic. Transmathematica. ISSN 2632-9212 (published 01-27-2020), (2020).
Avižienzis, A. Laprie, J.C., Randell, B. Fundamental concepts of dependability. In Workshop on Robot Dependability: Technological Challenge of Dependable Robots in Human Environments, Seoul (2001).
Avižienzis, A. Laprie, J.C., Randell, B., Landwehr, C. Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on dependable and secure computing, 1 (1), pp.1–23 (2004).
Jan Bergstra. Instruction sequence faults with formal change justification. Scientific Annals of Computer Science 30 (2), pp. 105–166 (2020).
Jan Bergstra. Qualifications of instruction sequence failures, faults and defects: dormant, effective, detected, temporary, and permanent. Scientific Annals of Computer Science 31 (1), pp. 1–50 (2021).
Jan Bergstra. Four notions of fault for program specifications. Scientific Annals of Computer Science 32 (2), pp. 183–209 (2022).
Jan Bergstra. A survey of testing for instruction sequence theory. Scientific Annals of Computer Science 32 (1), pp. 5–86 (2022).
Jan Bergstra. Defects and faults in algorithms, programs and instruction sequences. Transmathematica (2022). ISSN 2632-9212 (published 09-26-2022).
J.A. Bergstra and A. Ponse. Division by zero in common meadows. In R. de Nicola and R. Hennicker (editors), Software, Services, and Systems (Wirsing Festschrift), Lecture Notes in Computer Science 8950, pages 46-61, Springer, 2015. (2015). Also arXiv:1406.6878v4 [math.RA] (improved version, 2021).
J.A. Bergstra and A. Ponse. Fracpairs and fractions over a reduced commutative ring. Indigationes Mathematicae 27, 727 748, (2016).
J.A. Bergstra and J.V. Tucker. Which arithmetical data types admit fracterm flattening? Scientific Annals of Computer Science, 32 (1), 87–107, (2022).
J.A. Bergstra and J.V. Tucker. On the axioms of common meadows: Fracterm calculus, flattening and incompleteness. The Computer Journal, 66 (7), 1565-1572, (2023).
J.A. Bergstra and J.V. Tucker. Symmetric transrationals: The data type and the algorithmic degree of its equational theory, in N. Jansen et al. (eds.) A Journey From Process Algebra via Timed Automata to Model Learning - A Festschrift Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 13560, 63-80. Springer, 2022.
J.A. Bergstra and J.V. Tucker. Naive fracterm calculus. J. Universal Computer Science, 29 (9), 961-987, (2023).
J.A. Bergstra and J.V. Tucker. Synthetic fracterm calculus. J. Universal Computer Science, 30 (3), 289-307, (2024).
J. Carlström. 2004. Wheels–on division by zero, Mathematical Structures in Computer Science, 14 (1), (2004), 143-184.
J. Dias and B. Dinis. Strolling through common meadows. Communications in Algebra (2024), 1–28.
J. Dias and B. Dinis. Towards an Enumeration of finite common meadows. International Journal of Algebra and Computation (2024).
Laski, J. Programming faults and errors: towards a theory of software incorrectness. Annals of Software Engineering 4 pp. 79–114 (1997).
Mili, A., Frias, M.F., Jaoua, A. On faults and faulty programs. P. Höfner et al. (Eds.): RAMiCS 2014, LNCS 8428, pp. 191–207, (2014).
H. Ono. Equational theories and universal theories of fields. Journal of the Mathematical Society of Japan, 35(2), 289-306, (1983).
P. Suppes. Introduction to Logic. Van Nostrand Reinhold Company (1957).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Jan Aldert Bergstra
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors retain copyright and, if appropriate, performance rights but licence the journal to publish submissions. The lead author confirms that the submission is bound by the CC Attributtion Share Alike 4.0 licence.
