Abstract

We consider several novel congruences on the signature of meadows with the aim to survey different notions of fractions. In particular we suggest a notion of “true fraction”.

Highlights

  • This paper is written in honour of Rob van Glabbeek on the occasion of his 60th birthday.We congratulate Rob with this milestone and with his outstanding performance in the area of process theory.The idea of meadows is to introduce, on top of the signature of rings and fields, a function symbol for inverse, obtaining inversive notation x−1, or for division, thereby obtaining divisive notation (x/y, usually with the understanding that x−1 = 1/x), and to insist, or at least to prefer, that operations are total.An arithmetical datatype, admittedly an informal notion, is an abstract datatype which provides sorts and functions closely related to arithmetic.1Assuming that operations are total and that division is a named operation, the equational logic of known and sometimes novel structures is investigated

  • In [2] it is shown that fractions involving a single variable can be brought in so-called mixed fraction format

  • Some terminology which is conventional in the area of fractions has not been introduced in Sect

Read more

Summary

Introduction

This paper is written in honour of Rob van Glabbeek on the occasion of his 60th birthday. The idea of meadows is to introduce, on top of the signature of rings and fields, a function symbol for inverse, obtaining inversive notation x−1, or for division, thereby obtaining divisive notation (x/y, usually with the understanding that x−1 = 1/x), and to insist, or at least to prefer, that operations are total. For equational axioms for meadows see [5,11,21,23] and for further theoretical information we refer to [3,4].2

Fractions: a conceptual issue
Four perspectives on fractions
Related work on arithmetical datatypes
Fracterm terminology
Congruence-dependent properties of fracterms
Fracterm-related congruence properties
A transversal for FFT-arithmetical datatypes
The case of involutive meadows
Fracterm transparency over a commutative ring
GCD-based addition
A model with CFAR
An arithmetical datatype with a simplifying operator
Fracpair transparency with fracpairs as numbers
Two-dimensional vector meadows
True division with fracpair transparency
Concluding remarks
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.