Fracterm Calculus for Signed Common Meadows
DOI:
https://doi.org/10.36285/tm.97Keywords:
equational calculus, fracterm calculus, ordered fields, common meadow, sign function, equational specification, initial algebra semanticAbstract
A common meadow is an enrichment of a field with a division operator and an error value to make division total. A signed common meadow enriches a common meadow with a sign function that can be equationally axiomatised; the sign function can simulate an ordering on the underlying field but is not limited to orderings. In particular, of mathematical interest are the weakly signed common meadows. The prime example of a weakly signed common meadow is an expansion of a common meadow of complex numbers with a weak sign function. We show that all common meadows may be enlarged to a weakly signed common meadow. A special case is the 4-signed common meadows, which are precisely the enlargements of ordered fields. To illustrate the equational calculus for signed common meadows, we use it as a foundation for building a probability calculus and derive some classical formulae.
References
J. A. Anderson, N. Völker, and A. A. Adams. 2007. "Perspex 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).
T. Bayes and R. Price. "An Essay towards solving a problem in the doctrine of chance". By the late Rev. Mr. Bayes, communicated by Mr. Price, in a letter to John Canton, A.M. F.R.S. Philosophical Transactions of the Royal Society 53 (1763), 370–418.
J.A. Bergstra. "Adams conditioning and likelihood ratio transfer mediated inference". Scientific Annals of Computer Science, 29 (1), 1–58, (2019).
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).
J. A. Bergstra, I. Bethke, and D. Hendriks. "Universality of mixed fractions in divisive meadows". (2017).
J.A. Bergstra, I. Bethke, and A. Ponse. "Cancellation meadows: a generic basis theorem and some applications". The Computer Journal, 56(1):3–14, 2013.
J. A. Bergstra, I. Bethke, and A. Ponse. "Equations for formally real meadows". Journal of Applied Logic, 13(2): 1–23, (2015).
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).
J.A. Bergstra and A. Ponse. "Probability functions in the context of signed involutive meadows". (2016).
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. "The rational numbers as an abstract data type". Journal of the ACM, 54 (2), Article 7, (2007).
J.A. Bergstra and J.V. Tucker. 2020. "The transrational numbers as an abstract data type". Transmathematica, (2020).
J.A. Bergstra and J. V. Tucker. "Elementary algebraic specifications of the rational complex numbers". Lecture Notes in Computer Science, 4060, 459-475 (2006).
J.A. Bergstra and J.V. Tucker. 2021. "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.
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. "A complete finite axiomatisation of the equational theory of common meadows". (2023).
J.A. Bergstra and J.V. Tucker. "Rings with common division, common meadows, and their conditional equational theories". (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).
G. Birkhoff. 1935. "On the structure of abstract algebras". Mathematical Proceedings of the Cambridge Philosophical Society, 31 (4), 433-454.
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". To appear in Communications in Algebra.
J. Dias and B. Dinis. "Towards an Enumeration of finite common meadows". To appear in The International Journal of Algebra and Computation.
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-D. Ehrich, M. Wolf, and J. Loeckx. 1997. "Specification of Abstract Data Types". Vieweg Teubner, 1997.
J. Joyce. "Bayes’ Theorem". The Stanford Encyclopedia of Philosophy, editor Edward N. Zalta, Metaphysics Research Lab, Stanford University, Fall 2021.
S. Lang. 1965. "Algebra". Addison Wesley, 1965.
H. Ono. "Equational theories and universal theories of fields". Journal of the Mathematical Society of Japan, 35(2), 289-306, (1983).
H. Padmanabhan. "A self-dual equational basis for Boolean algebras". Canadian Mathematical Bulletin, 26(1):9–12, 1983.
A. Setzer. 1997. "Wheels (Draft)", Unpublished. 1997.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Jan Aldert Bergstra, John V Tucker
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.
