The Computer Journal · 2012 · 35 citations · 9 references
Natural SciencesMathematicsAlgebraDiscrete MathematicsNumber TheoryAbstract AlgebraAlgebraic Number TheoryRational NumbersAxiomatizationBasis ReductionCompletenessEquational LogicEquational ReasoningFinite Basis ProblemOperator ExtensionsOperators
Let Q_0 denote the rational numbers expanded to a ‘meadow’, that is, after taking its zero-totalized form (0^{−1}=0) as the preferred interpretation. In this paper, we consider ‘cancellation meadows’, i.e. meadows without proper zero divisors, such as Q_0 and prove a generic completeness result. We apply this result to cancellation meadows expanded with differentiation operators, the sign function, and with floor, ceiling and a signed variant of the square root, respectively. We give an equational<br/>axiomatization of these operators and thus obtain a finite basis for various expanded cancellation meadows.
9
Initial Algebra Semantics and Continuous Algebras
Joseph A. Goguen, J. W. Thatcher, Eric G. Wagner et al. · Journal of the ACM · 1977 · 803 citations · Full text
Computing, Computer Science, Algebra +12
Neil J. Calkin, Herbert S. Wilf · American Mathematical Monthly · 2000 · 196 citations
IM Bradley · Information and Software Technology · 1989 · 130 citations
The rational numbers as an abstract data type
J.A. Bergstra, John V. Tucker · Journal of the ACM · 2007 · 114 citations