Meadows and the equational specification of division

The rational, real and complex numbers with their standard operations, including division, are partial algebras specified by the axiomatic concept of a field. Since the class of fields cannot be defined by equations, the theory of equational specifications of data types cannot use field theory in applications to number systems based upon rational, real and complex numbers. We study a new axiomatic concept for number systems with division that uses only equations: a meadow is a commutative ring with a total inverse operator satisfying two equations which imply 0^-^1=0. All fields and products of fields can be viewed as meadows. After reviewing alternate axioms for inverse, we start the development of a theory of meadows. We give a general representation theorem for meadows and find, as a corollary, that the conditional equational theory of meadows coincides with the conditional equational theory of zero totalized fields. We also prove representation results for meadows of finite characteristic.

[1]  Jan A. Bergstra,et al.  Elementary Algebraic Specifications of the Rational Function Field , 2006, CiE.

[2]  MA John Harrison PhD.  Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[3]  Viggo Stoltenberg-Hansen,et al.  Computable Rings and Fields , 1999, Handbook of Computability Theory.

[4]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[5]  Jan A. Bergstra,et al.  Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems , 1983, SIAM J. Comput..

[6]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[7]  Jan A. Bergstra,et al.  The rational numbers as an abstract data type , 2007, JACM.

[8]  Jan A. Bergstra,et al.  Fields, Meadows and Abstract Data Types , 2008, Pillars of Computer Science.

[9]  J. V. Tucker,et al.  Skew Meadows , 2009, 0901.0803.

[10]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[11]  Michael Patrick. O'Donnell,et al.  Theory of rings , 1952 .

[12]  Jan A. Bergstra,et al.  The Completeness of the Algebraic Specification Methods for Computable Data Types , 1982, Inf. Control..

[13]  Tuomas Sandholm,et al.  Lossless abstraction of imperfect information games , 2007, JACM.

[14]  Ken R. Goodearl,et al.  Von Neumann regular rings , 1979 .

[15]  G. Birkhoff.  Subdirect unions in universal algebra , 1944 .

[16]  Neal H. McCoy,et al.  Subrings of infinite direct sums , 1938 .

[17]  Jan A. Bergstra,et al.  Division Safe Calculation in Totalised Fields , 2008, Theory of Computing Systems.

[18]  Jan A. Bergstra,et al.  Equational specifications, complete term rewriting systems, and computable and semicomputable algebras , 1995, JACM.

[19]  Edward R. Griffor.  Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[20]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

[21]  Lawrence S. Moss,et al.  Simple Equational Specifications of Rational Arithmetic , 2001, Discret. Math. Theor. Comput. Sci..

[22]  Karl Meinke,et al.  Universal algebra , 1993, LICS 1993.

[23]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[24]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[25]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[26]  Jan A. Bergstra,et al.  Algebraic Specifications of Computable and Semicomputable Data Types , 1987, Theor. Comput. Sci..

[27]  Jan A. Bergstra,et al.  Elementary Algebraic Specifications of the Rational Complex Numbers , 2006, Essays Dedicated to Joseph A. Goguen.

[28]  J. V. Tucker,et al.  The completeness of the algebraic specification methods for data types : (preprint) , 1980 .

[29]  J. Bergstra,et al.  A generic basis theorem for cancellation meadows , 2008 .