The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable

Robin Hirsch. The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable. Logic Journal of the IGPL, 13(2):159-171, 2005. [doi]

Abstract

Abstract is missing.