Article ID Journal Published Year Pages File Type
10118868 Annals of Pure and Applied Logic 2005 19 Pages PDF
Abstract
Let n be a positive integer and FAℓ(n) be the free abelian lattice-ordered group on n generators. We prove that FAℓ(m) and FAℓ(n) do not satisfy the same first-order sentences in the language L={+,−,0,∧,∨} if m≠n. We also show that Th(FAℓ(n)) is decidable iff n∈{1,2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices.
Related Topics
Physical Sciences and Engineering Mathematics Logic
Authors
, , ,