Free abelian lattice-ordered groups

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

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Elementary Equivalence for Abelian-by-Finite and Nilpotent Groups.Francis Oger - 2001 - Journal of Symbolic Logic 66 (3):1471-1480.
Borel reductions of profinite actions of SL n.Samuel Coskey - 2010 - Annals of Pure and Applied Logic 161 (10):1270-1279.
Finite automata presentable Abelian groups.André Nies & Pavel Semukhin - 2010 - Annals of Pure and Applied Logic 161 (3):458-467.
The free n -generated BL-algebra.Stefano Aguzzoli & Simone Bova - 2010 - Annals of Pure and Applied Logic 161 (9):1144-1170.
Definable groups in models of Presburger Arithmetic.Alf Onshuus & Mariana Vicaría - 2020 - Annals of Pure and Applied Logic 171 (6):102795.

Analytics

Added to PP
2014-01-16

Downloads
19 (#824,557)

6 months
6 (#588,740)

Historical graph of downloads
How can I increase my downloads?

References found in this work

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