Finitely Presented Abelian Lattice-Ordered Groups

We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of generators is at most 3, then elementary equivalence implies isomorphism. We deduce from our methods that the theory of the free MV -algebra on at least 2 generators is undecidable.

• Type: Conference
• Year: 2006
• Where: BIRTHDAY
• Authors: Andrew M. W. Glass, Françoise Point
• Keywords: Abelian Lattice-ordered Group, Applied Computing, BIRTHDAY 2006, Equivalence Implies Isomorphism, First-order Theory