z-logo
open-access-imgOpen Access
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness
Author(s) -
J.A. Bergstra,
John V. Tucker
Publication year - 2022
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/bxac026
Subject(s) - axiom , mathematics , division (mathematics) , calculus (dental) , simple (philosophy) , commutative property , axiomatic system , algebra over a field , extension (predicate logic) , pure mathematics , discrete mathematics , computer science , arithmetic , epistemology , geometry , medicine , philosophy , dentistry , programming language
Common meadows are arithmetic structures with inverse or division, made total on $0$ by a flag $\bot $ 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 characteristic $0$. Here, we show that these axioms do not prove all conditional equations which hold in all common cancellation meadows of characteristic $0$.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom