Inversive meadows and divisive meadows

DOI10.1016/J.JAL.2011.03.001zbMATH Open1251.68144arXiv0907.0540OpenAlexW3103826574MaRDI QIDQ420833FDOQ420833

Authors: C. A. Middelburg, J. A. Bergstra 

Publication date: 23 May 2012

Published in: Journal of Applied Logic (Search for Journal in Brave)

Abstract: Inversive meadows are commutative rings with a multiplicative identity element and a total multiplicative inverse operation whose value at 0 is 0. Divisive meadows are inversive meadows with the multiplicative inverse operation replaced by a division operation. We give finite equational specifications of the class of all inversive meadows and the class of all divisive meadows. It depends on the angle from which they are viewed whether inversive meadows or divisive meadows must be considered more basic. We show that inversive and divisive meadows of rational numbers can be obtained as initial algebras of finite equational specifications. In the spirit of Peacock's arithmetical algebra, we study variants of inversive and divisive meadows without an additive identity element and/or an additive inverse operation. We propose simple constructions of variants of inversive and divisive meadows with a partial multiplicative inverse or division operation from inversive and divisive meadows. Divisive meadows are more basic if these variants are considered as well. We give a simple account of how mathematicians deal with 1 / 0, in which meadows and a customary convention among mathematicians play prominent parts, and we make plausible that a convincing account, starting from the popular computer science viewpoint that 1 / 0 is undefined, by means of some logic of partial functions is not attainable.

Full work available at URL: https://arxiv.org/abs/0907.0540

Recommendations

• Division by zero in non-involutive meadows
• Meadows and the equational specification of division
• Transformation of fractions into simple fractions in divisive meadows
• Fields, Meadows and Abstract Data Types
• Division by zero in common meadows

zbMATH Keywords

divisive meadowarithmetical meadowimperative meadowinversive meadowpartial meadowrelevant division convention

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Title not available (Why is that?)
• On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus
• Title not available (Why is that?)
• On notation for ordinal numbers
• The rational numbers as an abstract data type
• Inversive meadows and divisive meadows
• Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
• A propositional logic with 4 values: true, false, divergent and meaningless
• The initial meadows
• A logic covering undefinedness in program proofs
• Meadows and the equational specification of division
• Equational theories and universal theories of fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Straight-line instruction sequence completeness for total calculation on cancellation meadows
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Module algebra
• Partial logics reconsidered: A conservative approach
• Algebraic specifications of computable and semicomputable data types
• Right-divisive groups
• Program algebra for sequential code
• Completeness in arithmetical algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inversive semigroups, I
• Instruction sequence processing operators
• A first order logic for partial functions

Cited In (16)

• Fields, Meadows and Abstract Data Types
• Partial arithmetical data types of rational numbers and their equational specification
• Imperative process algebra and models of parallel computation
• Instruction sequence processing operators
• Subvarieties of the Variety of Meadows
• The initial meadows
• Fracpairs and fractions over a reduced commutative ring
• Inversive meadows and divisive meadows
• Transformation of fractions into simple fractions in divisive meadows
• A process calculus with finitary comprehended terms
• Meadows and the equational specification of division
• Division by zero in common meadows
• Division by zero in non-involutive meadows
• Arithmetical datatypes with true fractions
• The wheel of rational numbers as an abstract data type
• A negative result on algebraic specifications of the meadow of rational numbers

This page was built for publication: Inversive meadows and divisive meadows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420833)