English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We analyse abstract data types that model numerical structures with a conceptof error. Specifically, we focus on arithmetic data types that contain an errorflag $\bot$ whose main purpose is to always return a value for division. Torings and fields we add a division operator $x/y$ and study a class of algebrascalled \textit{common meadows} wherein $x/0 = \bot$. The set of equations truein all common meadows is named the \textit{fracterm calculus of commonmeadows}. We give a finite equational axiomatisation of the fracterm calculusof common meadows and prove that it is complete and that the fracterm calculusis decidable.

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows