Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

BIRTHDAY
2006
Springer

favoriteEmaildiscussreport

102views Applied Computing» more BIRTHDAY 2006»

Finitely Presented Abelian Lattice-Ordered Groups

13 years 8 months ago

Finitely Presented Abelian Lattice-Ordered Groups

Download www.dpmms.cam.ac.uk

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.

Andrew M. W. Glass, Françoise Point

Real-time Traffic

Abelian Lattice-ordered Group | Applied Computing | BIRTHDAY 2006 | Equivalence Implies Isomorphism | First-order Theory |

claim paper

Related Content

» Sequences in abelian groups G of odd order without zerosum subsequences of length exp G

» Average Spectra and Minimum Distances of LowDensity ParityCheck Codes over Abelian Groups

» Distributed Source Coding using Abelian Group Codes

» Blinded Fault Resistant Exponentiation

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	BIRTHDAY
Authors	Andrew M. W. Glass, Françoise Point

Comments (0)