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/

Zendy Plus

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

Zendy Tools

Zendy Open

We analyse abstract data types that model numerical structures with a conceptof error. Specifically, we focus on arithmetic data types that contain an errorvalue $\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 ofalgebras called common meadows wherein $x/0 = \bot$. The set of equations truein all common meadows is named the equational theory of common meadows. We givea finite equational axiomatisation of the equational theory of common meadowsand prove that it is complete and that the equational theory is decidable.

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows