Annals of Pure and Applied Logic 134 (2-3):265-283 (2005)

Let n be a positive integer and FAℓ be the free abelian lattice-ordered group on n generators. We prove that FAℓ and FAℓ do not satisfy the same first-order sentences in the language if m≠n. We also show that is decidable iff n{1,2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2004.10.017
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,091
Through your library

References found in this work BETA

Undecidability of Some Topological Theories.Andrzej Grzegorczyk - 1953 - Journal of Symbolic Logic 18 (1):73-74.
Elementary Properties of Abelian Groups.W. Szmielew - 1959 - Journal of Symbolic Logic 24 (1):59-59.

Add more references

Citations of this work BETA

On Free MV Algerbras and Problem of Tarski.Antonio Di Nola, Giacomo Lenzi & Gaetano Vitale - 2016 - Mathematical Logic Quarterly 62 (3):232-240.

Add more citations

Similar books and articles

Existential Equivalence of Ordered Abelian Groups with Parameters.V. Weispfenning - 1990 - Archive for Mathematical Logic 29 (4):237-248.
The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups.Philip Scowcroft - 2007 - Notre Dame Journal of Formal Logic 48 (4):521-550.
Some Model Theory for Almost Real Closed Fields.Françoise Delon & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (4):1121-1152.


Added to PP index

Total views
12 ( #809,294 of 2,506,345 )

Recent downloads (6 months)
1 ( #416,997 of 2,506,345 )

How can I increase my downloads?


My notes