Structural Equivalence of Arithmetical Expressions as a Technical Basis for Philosophical Arithmetic
DOI:
https://doi.org/10.36285/tm.99Abstract
The word “fracterm” is a portmanteau of “fraction” and “term.” Fracterms are instances of arithmetical terms, A-terms, for short. Four notions of correspondence for A-terms are distinguished: syntactic equality, structural equivalence, semantic equivalence (having the same value), and frugal equality. We provide axioms for structural equivalence and discuss the connection with semantic equivalence and frugal equality.
References
J. A. Anderson, N. Völker, and A. A. Adams. 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. Sumterms, summands, sumtuples, and sums and the meta-arithmetic of summation. Scientific Annals of Computer Science, 30 (2), 167-203, (2020).
J. A. Bergstra. Fractions in transrational arithmetic. Transmathematica. ISSN 2632-9212 (published 01-27-2020), (2020).
J. A. Bergstra. Prospective, retrospective, and formal division – a contribution to philosophical arithmetic. Transmathematica. ISSN 2632-9212 (published 17-10-2020), (2020).
J. A. Bergstra, I. Bethke, and P. H. Rodenburg: A propositional logic with 4 values: true, false, divergent and meaningless, Journal of Applied Non-Classical Logics. 5, part 2 (1995) 199–217.
J. A. Bergstra, J. Heering, and P. Klint. Module algebra. Journal of the ACM, 37 (2): 335–372, (1990).
J. A. Bergstra and C.A. Middelburg. Inversive meadows and divisive meadows. Journal of Applied Logic, 9(3): 203–220 (2011).
J. A. Bergstra and C. A. Middelburg. Transformation of fractions into simple fractions in divisive meadows. Journal of Applied Logic, 16: 92–110, (2015).
J. A. Bergstra and A. Ponse. Proposition algebra. ACM Transactions on Computational Logic 12 (2) Article no. 21, pp 1-36, (2011).
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 A. Ponse. Conditional logic as a short-circuit logic. arXiv:2304.14821 [cs.LO] (2023).
J. A. Bergstra and J.V. Tucker. The transrational numbers as an abstract data type. Transmathematica, (2020).
J. A. Bergstra and J.V. Tucker. The wheel of rational numbers as an abstract data type. In Roggenbach M. (editor), Recent Trends in Algebraic Development Techniques. WADT 2020. Lecture Notes in Computer Science 12669, Springer, 13–30, (2021).
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. Eager equality for rational number arithmetic. ACM Transactions on Computational Logic, 24 (3) Article no. 22, pp 1–28 (2023).
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), 143-184, (2004).
J. Dias and B. Dinis. Strolling through common meadows. Communications in Algebra 1–28, (2024).
J. Dias and B. Dinis. Towards an Enumeration of finite common meadows. International Journal of Algebra and Computation, (2024).
F. Guzmán, and C. C. Squier. The algebra of conditional logic. Algebra Universalis, 27:88-110. (1990).
T. S. dos Reis, W. Gomide, and J. A. Anderson. 2016. Construction of the transreal numbers and algebraic transfields. IAENG International Journal of Applied Mathematics, 46 (1) (2016), 11–23.
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.
