English

Rings with common division, common meadows and their conditional equational theories

Logic in Computer Science 2024-12-25 v2 Symbolic Computation

Abstract

We examine the consequences of having a total division operation xy\frac{x}{y} on commutative rings. We consider two forms of binary division, one derived from a unary inverse, the other defined directly as a general operation; each are made total by setting 1/01/0 equal to an error value \bot, which is added to the ring. Such totalised divisions we call common divisions. In a field the two forms are equivalent and we have a finite equational axiomatisation EE that is complete for the equational theory of fields equipped with common division, called common meadows. These equational axioms EE turn out to be true of commutative rings with common division but only when defined via inverses. We explore these axioms EE and their role in seeking a completeness theorem for the conditional equational theory of common meadows. We prove they are complete for the conditional equational theory of commutative rings with inverse based common division. By adding a new proof rule, we can prove a completeness theorem for the conditional equational theory of common meadows. Although, the equational axioms EE fail with common division defined directly, we observe that the direct division does satisfies the equations in EE under a new congruence for partial terms called eager equality.

Keywords

Cite

@article{arxiv.2405.01733,
  title  = {Rings with common division, common meadows and their conditional equational theories},
  author = {Jan A Bergstra and John V Tucker},
  journal= {arXiv preprint arXiv:2405.01733},
  year   = {2024}
}
R2 v1 2026-06-28T16:14:53.986Z