The rational numbers as an abstract data type

We give an equational specification of the field operations on the rational numbers under initial algebra semantics using just total field operations and 12 equations. A consequence of this specification is that 0−1 = 0, an interesting equation consistent with the ring axioms and many properties of division. The existence of an equational specification of the rationals without hidden functions was an open question. We also give an axiomatic examination of the divisibility operator, from which some interesting new axioms emerge along with equational specifications of algebras of rationals, including one with the modulus function. Finally, we state some open problems, including: Does there exist an equational specification of the field operations on the rationals without hidden functions that is a complete term rewriting system?

[1]  J. V. Tucker,et al.  Abstract versus concrete computation on metric partial algebras , 2001, TOCL.

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

[3]  J. V. Tucker,et al.  Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.

[4]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[5]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[6]  Min Chen,et al.  Constructive Volume Geometry , 2000, Comput. Graph. Forum.

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

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

[9]  José Meseguer,et al.  Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability , 1987, Category Theory and Computer Science.

[10]  Viggo Stoltenberg-Hansen,et al.  Concrete Models of Computation for Topological Algebras , 1999, Theor. Comput. Sci..

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

[12]  J. V. Tucker,et al.  Computable total functions on metric algebras, universal algebraic specifications and dynamical systems , 2005, J. Log. Algebraic Methods Program..

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

[14]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.

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

[16]  John Robert Harrison,et al.  Theorem proving with the real numbers , 1998, CPHC/BCS distinguished dissertations.

[17]  A. vanWijngaarden,et al.  Numerical analysis as an independent science : (bit, nordisk tidskrift for informations-behandling, _6(1966), p 66-81) , 1966 .

[18]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[19]  Markus Roggenbach,et al.  Specifying Real Numbers in CASL , 1999, WADT.

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

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

[22]  J. V. Tucker,et al.  Effective algebras , 1995, Logic in Computer Science.

[23]  John C. Reynolds,et al.  Algebraic Methods in Semantics , 1985 .

[24]  G Hildebrandt,et al.  Wheels , 1974 .

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

[26]  Jesper Carlström,et al.  Wheels – on division by zero , 2004, Mathematical Structures in Computer Science.

[27]  Magne Haveraaen,et al.  Case study on algebraic software methodologies for scientific computing , 2000, Sci. Program..

[28]  A. van Wijngaarden,et al.  Numerical analysis as an independent science , 1966 .

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

[30]  Claude Marché,et al.  Rewrite Systems for Natural, Integral, and Rational Arithmetic , 1997, RTA.

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

[32]  Herbert S. Wilf,et al.  Recounting the Rationals , 2000, Am. Math. Mon..

[33]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[34]  Magne Haveraaen,et al.  Computable scalar fields: A basis for PDE software , 2005, J. Log. Algebraic Methods Program..

[35]  坂井 公,et al.  Universal Algebra for Computer Scientists, Wolfgang Wechler, Springer-Verlag, 1992 , 1994 .

[36]  J. Adámek,et al.  On abstract data types presented by multiequations , 2002, Theor. Comput. Sci..

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

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

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

[40]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[41]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

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

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

[44]  Joseph A. Goguen,et al.  Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability , 1992, Theor. Comput. Sci..

[45]  Dan Suciu,et al.  Journal of the ACM , 2006 .