Skip to main content Accessibility help

The initial meadows

  • Inge Bethke (a1) and Piet Rodenburg (a2)


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.



Hide All
[1]Bergstra, J.A., Hirshfeld, Y., and Tucker, J.V., Fields, meadows and abstract data types, Pillars of computer science, essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday (Avron, al, editor), Lecture Notes in Computer Science, vol. 4800, Springer, 2008, pp. 166178.
[2]Bergstra, J.A., Hirshfeld, Y., and Tucker, J.V., Meadows and the equational specification of division, Theoretical Computer Science, vol. 410 (2009), pp. 12611271.
[3]Bergstra, J.A. and Tucker, J.V., The rational numbers as an abstract data type, Journal of the ACM, vol. 54 (2007), no. 2.
[4]Bethke, I. and Rodenburg, P., Some properties of finite meadows, CoRR abs/0712.0917, 2007.
[5]Birkhoff, G., Subdirect unions in universal algebra, Bulletin of the American Mathematical Society, vol. 50 (1944), no. 10, pp. 764768.
[6]Birkhoff, G., Lattice theory, vol. 25, American Mathematical Society Colloquium Publications, 1991.
[7]Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B., Initial algebra semantics and continuous algebras. Journal of the ACM, vol. 24 (1977), no. 1, pp. 6895.
[8]Goodearl, K.R., Von Neumann regular rings, Pitman, London, San-Francisco, Melbourne, 1979.
[9]Grätzer, G., Universal algebra, 2nd ed., Springer, 1979.
[10]McKenzie, R.N., Nulty, G.F. Mc, and Taylor, W.F., Algebras, lattices, varieties, Wadsworth & Brooks, Monterey, California, 1987.
[11]Stoltenberg-Hansen, V. and Tucker, J.V., Computable rings and fields, Handbook of computability theory (Griffor, E.R., editor), Studies in Logic and the Foundations of Mathematics, vol. 140, Elsevier, 1999, pp. 363447.
[12]Wechler, W., Universal algebra for computer scientists, EATCS Monographs in Computer Science, Springer, 1992.



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed