Fracpairs and fractions over a reduced commutative ring
The original motivation of this paper comes from the datatypes in computer science, but we face a nice small work in algebra and logic. Fraction fields over domains are defined so that the denominator is not allowed to be zero. In the present generalization of the field of fractions, the ring is only supposed to be commutative and not to contain nilpotent elements and the denominator equal zero is permited. So, one can compute with fractions (fracpairs) over \(\mathbb Z _6\) and \(\frac{1}{0}\) so as \(\frac{2}{0}\) are legal elements of the resulting meadow. The structures studied are kept equational, and most of the discussion focusses on term rewriting.
- Division by zero in common meadows
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- scientific article; zbMATH DE number 1633834 (Why is no real title available?)
- scientific article; zbMATH DE number 3757085 (Why is no real title available?)
- scientific article; zbMATH DE number 43569 (Why is no real title available?)
- Inversive meadows and divisive meadows
- Rewrite systems for natural, integral, and rational arithmetic
- Termination orderings for associative-commutative rewriting systems
- The initial meadows
- The rational numbers as an abstract data type
- Partial arithmetical data types of rational numbers and their equational specification
- Arithmetical datatypes with true fractions
- The wheel of rational numbers as an abstract data type
- scientific article; zbMATH DE number 4204513 (Why is no real title available?)
- scientific article; zbMATH DE number 23442 (Why is no real title available?)
- scientific article; zbMATH DE number 1418057 (Why is no real title available?)
- The determination of when the fractions of \({Z_n}\) are fields
- Datatype defining rewrite systems for naturals and integers
- Eager Equality for Rational Number Arithmetic
- Symmetric transrationals: the data type and the algorithmic degree of its equational theory
- Which arithmetical data types admit fracterm flattening?
- Logical models of mathematical texts: the case of conventions for division by zero.
- Logical models of mathematical texts. II: legality conventions for division by zero in inconsistent contexts
- A complete finite axiomatisation of the equational theory of common meadows
This page was built for publication: Fracpairs and fractions over a reduced commutative ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297980)