vix.ing · top · new · best · stats · spec

The rational numbers as an abstract data type

2007/04/01 by J.A. Bergstra, John V. Tucker · 3 citations
Computer Science · Mathematics · #Logic, programming, and type systems #Advanced Algebra and Logic #Logic, Reasoning, and Knowledge #Rational number #Rewriting #Axiom #Rational function #Mathematics #Algebra over a field #Divisibility rule #Field (mathematics) #Operator (biology) #Ring (chemistry) #Function (biology) #Discrete mathematics #Pure mathematics #Computer science #Programming language

paper · doi:10.1145/1219092.1219095

openalex publication_date 2007/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11

Abstract

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?

Cited by