Division by zero in non-involutive meadows

DOI10.1016/J.JAL.2014.10.001zbMATH Open1401.68209arXiv1406.2092OpenAlexW3098342754MaRDI QIDQ2018605FDOQ2018605

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

Publication date: 24 March 2015

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

Abstract: Meadows have been proposed as alternatives for fields with a purely equational axiomatization. At the basis of meadows lies the decision to make the multiplicative inverse operation total by imposing that the multiplicative inverse of zero is zero. Thus, the multiplicative inverse operation of a meadow is an involution. In this paper, we study `non-involutive meadows', i.e. variants of meadows in which the multiplicative inverse of zero is not zero, and pay special attention to non-involutive meadows in which the multiplicative inverse of zero is one.

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

Recommendations

• Inversive meadows and divisive meadows
• Meadows and the equational specification of division
• Division by zero in common meadows
• Transformation of fractions into simple fractions in divisive meadows
• The initial meadows

zbMATH Keywords

equational specificationinitial algebra specificationnon-involutive meadowone-based non-involutive meadowone-totalized fieldone-totalized field of rational numbers

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The rational numbers as an abstract data type
• Inversive meadows and divisive meadows
• The initial meadows
• Meadows and the equational specification of division
• Equational theories and universal theories of fields
• A process calculus with finitary comprehended terms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Straight-line instruction sequence completeness for total calculation on cancellation meadows

Cited In (14)

• Fields, Meadows and Abstract Data Types
• Note on paraconsistency and reasoning about fractions
• The initial meadows
• Title not available (Why is that?)
• Symmetric transrationals: the data type and the algorithmic degree of its equational theory
• Inversive meadows and divisive meadows
• Transformation of fractions into simple fractions in divisive meadows
• Datatype defining rewrite systems for naturals and integers
• Meadows and the equational specification of division
• Division by zero in common meadows
• Arithmetical datatypes with true fractions
• The structure of finite meadows
• Division safe calculation in totalised fields
• A negative result on algebraic specifications of the meadow of rational numbers

This page was built for publication: Division by zero in non-involutive meadows

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