Processing math: 100%

Representable lattice-ordered groups

Abbreviation: RLGrp

Definition

A \emph{representable lattice-ordered group} (or \emph{representable} \emph{-group}) is a lattice-ordered group L=L,,,,1,e that satisfies the identity

(xy)2=x2y2

Morphisms

Let L and M be -groups. A morphism from L to M is a function f:LM that is a homomorphism: f(xy)=f(x)f(y) and f(xy)=f(x)f(y).

Remark: It follows that f(xy)=f(x)f(y), f(x1)=f(x)1, and f(e)=e

Examples

Basic results

Every representable -group is a subdirect product of totally ordered groups.

Properties

Finite members

None

Subclasses

Superclasses

References


1) Yuri Gurevic, \emph{Hereditary undecidability of a class of lattice-ordered Abelian groups}, Algebra i Logika Sem., \textbf{6}, 1967, 45–62
2) Stanley Burris, \emph{A simple proof of the hereditary undecidability of the theory of lattice-ordered abelian groups}, Algebra Universalis, \textbf{20}, 1985, 400–401, http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/HerUndecLOAG.pdf
3) A. M. W. Glass, D. Saracino and C. Wood, \emph{Non-amalgamation of ordered groups}, Math. Proc. Camb. Phil. Soc. 95 (1984), 191–195
4) Mona Cherri and Wayne B. Powell, \emph{Strong amalgamation of lattice ordered groups and modules}, International J. Math. & Math. Sci., Vol 16, No 1 (1993) 75–80, http://www.hindawi.com/journals/ijmms/1993/405126/abs/ doi:10.1155/S0161171293000080

QR Code
QR Code representable_lattice-ordered_groups (generated for current page)