On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness

Open Access
Authors
Publication date 07-2023
Journal Computer Journal
Volume | Issue number 66 | 7
Pages (from-to) 1565-1572
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
Common meadows are arithmetic structures with inverse or division, made total on 0 by a flag ⊥ for ease of calculation. We examine some axiomatizations of common meadows to clarify their relationship with commutative rings and serve different theoretical agendas. A common meadow fracterm calculus is a special form of the equational axiomatization of common meadows, originally based on the use of division on the rational numbers. We study axioms that allow the basic process of simplifying complex expressions involving division. A useful axiomatic extension of the common meadow fracterm calculus imposes the requirement that the characteristic of common meadows be zero (using a simple infinite scheme of closed equations). It is known that these axioms are complete for the full equational theory of common cancellation meadows of haracteristic 0⁠. Here, we show that these axioms do not prove all conditional equations which hold in all common cancellation meadows of characteristic 0.
Document type Article
Language English
Published at https://doi.org/10.1093/comjnl/bxac026
Downloads
On The Axioms Of Common Meadows (Final published version)
Permalink to this page
Back