The initial meadows. (English) Zbl 1217.68142

Meadows, introduced about a decade ago by Bergstra and Tucker, provide a total algebra alternative for fields. In short, a meadow is a commutative ring with an inverse for multiplication which has 0 as a fixed point. This paper develops the initial meadow of characteristic 0 and proves a normal-form theorem for it. Immediate consequences are the decidability of the closed-term problem for meadows and the computability of their initial object.


68Q65 Abstract data types; algebraic specification
03B25 Decidability of theories and sets of sentences
Full Text: DOI arXiv


[1] DOI: 10.1016/j.tcs.2008.12.015 · Zbl 1172.68039
[2] Pillars of computer science, essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday 4800 pp 166– (2008) · Zbl 1132.68002
[3] Universal algebra for computer scientists (1992)
[4] DOI: 10.1016/S0049-237X(99)80028-7
[5] Universal algebra (1979)
[6] Journal of the ACM 54 (2007)
[7] Von Neumann regular rings (1979) · Zbl 0411.16007
[8] DOI: 10.1145/321992.321997 · Zbl 0359.68018
[9] Lattice theory 25 (1991)
[10] DOI: 10.1090/S0002-9904-1944-08235-9 · Zbl 0060.05809
[11] Algebras, lattices, varieties (1987)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.