Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rings with common division, common meadows and their conditional equational theories (2405.01733v2)

Published 2 May 2024 in cs.LO and cs.SC

Abstract: We examine the consequences of having a total division operation $\frac{x}{y}$ on commutative rings. We consider two forms of binary division, one derived from a unary inverse, the other defined directly as a general operation; each are made total by setting $1/0$ equal to an error value $\bot$, which is added to the ring. Such totalised divisions we call common divisions. In a field the two forms are equivalent and we have a finite equational axiomatisation $E$ that is complete for the equational theory of fields equipped with common division, called common meadows. These equational axioms $E$ turn out to be true of commutative rings with common division but only when defined via inverses. We explore these axioms $E$ and their role in seeking a completeness theorem for the conditional equational theory of common meadows. We prove they are complete for the conditional equational theory of commutative rings with inverse based common division. By adding a new proof rule, we can prove a completeness theorem for the conditional equational theory of common meadows. Although, the equational axioms $E$ fail with common division defined directly, we observe that the direct division does satisfies the equations in $E$ under a new congruence for partial terms called eager equality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. J.A.D.W. Anderson and J. A. Bergstra. Review of Suppes 1957 proposals for division by zero. Transmathematica. https://doi.org/10.36285/tm.53
  2. Perspex Machine VIII, axioms of transreal arithmetic. In: Latecki, J., Mount, D.M., and Wu, A.Y. (Eds.), Proc. SPIE 6499, Vision Geometry XV, 649902 (29 January 2007). https://doi.org/10.1117/12.698153
  3. J. A. Bergstra. Division by zero, a survey of options. Transmathematica, ISSN 2632-9212, (published 2019-06-25), https://doi.org/10.36285/tm.v0i0.17, (2019).
  4. J.A. Bergstra. Dual number meadows. Transmathematica. ISSN 2632-9212 (published 06-25-2019), https://doi.org/10.36285/tm.v0i0.11, (2019).
  5. J.A. Bergstra. Arithmetical datatypes, fracterms, and the fraction definition problem. Transmathematica, ISSN 2632-9212, (published 2020-04-30), https://doi.org/10.36285/tm.33, (2020).
  6. J. A. Bergstra, I. Bethke and A. Ponse. Cancellation meadows: a generic basis theorem and some applications. The Computer Journal, 56 (1) (2013), 3–14. Also arxiv.org/abs/0803.3969.
  7. J.A. Bergstra and C.A. Middelburg. Transformation of fractions into simple fractions in divisive meadows. Journal of Applied Logic, 16 (2016), 92–110. https://doi.org/10.1016/j.jal.2016.03.001 (Also https://arxiv.org/abs/1510.06233, 2015.)
  8. Division by zero in common meadows. In R. de Nicola and R. Hennicker (Eds.), Software, Services, and Systems (Wirsing Festschrift), LNCS 8950, pages 46-61, Springer, 2015. https://doi.org/10.1007/978-3-319-15545-6_6 Also available, in improved form, at https://arxiv.org/abs/1406.6878 [math.RA](2021).
  9. J.A. Bergstra and J. V. Tucker. The rational numbers as an abstract data type. Journal of the ACM, 54 (2) (2007), Article 7 (25 pages). https://doi.org/10.1145/1219092.1219095
  10. J.A. Bergstra and J. V. Tucker. The transrational numbers as an abstract datatype. Transmathematica, 2020. https://doi.org/10.36285/tm.47
  11. 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, 2021, 13–30.
  12. J.A. Bergstra and J. V. Tucker. Totalising Partial algebras: teams and splinters. Transmathematica. 2022. https://doi.org/10.36285/tm.57
  13. J.A. Bergstra and J. V. Tucker. On the axioms of common meadows: Fracterm calculus, flattening and incompleteness. The Computer Journal 66 (7) (2022) 1565-1572. https://doi.org/10.1093/comjnl/bxac026
  14. Eager equality for rational number arithmetic. ACM Transactions on Computational Logic, 24 (3) (2023) Article 22, pp 1-28 https://doi.org/10.1145/3580365
  15. J.A. Bergstra and J. V. Tucker A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows, arXiv:2307.04270 https://doi.org/10.48550/arXiv.2307.04270
  16. 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.
  17. G. Birkhoff. On the structure of abstract algebras. Mathematical Proceedings of the Cambridge Philosophical Society, 31(4) (1935):433-454.
  18. S. Burris and H. P. Sankapannavar, A Course in Universal Algebra, Springer-Verlag, 1981.
  19. J. Carlström. Wheels–on division by zero. Mathematical Structures in Computer Science, 14 (1) pp. 143–184, (2004). https://doi.org/10.1017/S0960129503004110
  20. Strolling through Common Meadows. arXiv:2311.05460 [math.RA] (2023).
  21. Enumerating finite Common Meadows. arXiv:2401.10631 [math.RA] (2024).
  22. Construction of the transreal numbers and algebraic transfields. IAENG International Journal of Applied Mathematics, 46 (1), 11–23, (2016). (http://www.iaeng.org/IJAM/issues_v46/issue_1/IJAM_46_1_03.pdf)
  23. T.S. dos Reis. Transreal integral. Transmathematica, 2019. https://doi.org/10.36285/tm.v0i0.13.
  24. Specification of Abstract Data Types. Vieweg Teubner, 1997.
  25. S. C. Kleene. Introduction to Metamathematics. North-Holland Pub. Co., Amsterdam (1952). https://doi.org/10.2307/2268620
  26. K. Meinke and J. V. Tucker. Universal Algebra, in S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum (eds), Handbook of Logic in Computer Science, Oxford UP, 1992. https://doi.org/10.1093/oso/9780198537359.003.0003
  27. H. Ono. Equational theories and universal theories of fields. Journal of the Mathematical Society of Japan, 35 (2) (1983):289-306. https://doi.org/10.2969/jmsj/03520289
  28. A. Setzer. Wheels (draft). http://www.cs.swan.ac.uk/csetzer/articles/wheel.pdf, (1997).
  29. P. Suppes. 1957. Introduction to Logic. Van Nostrand Reinhold, 1957.
  30. B. L. van der Waerden. Modern Algebra. Volume 1. Frederick Ungar Publishing Company, 1970.
Citations (1)

Summary

We haven't generated a summary for this paper yet.