A meadow is a commutative ring with an inverse operator satisfying 0-1=0. We determine the initial algebra of the meadows of characteristic 0 and prove a normal form theorem for it. As an immediate consequence we obtain the decidability of the closed term problem for meadows and the computability of their initial object.
"The initial meadows." J. Symbolic Logic 75 (3) 888 - 895, September 2010. https://doi.org/10.2178/jsl/1278682205