FOM: re:computable, non-abelian ordered group

Dave Marker marker at
Wed Nov 7 11:53:45 EST 2001

Suppose F is a computable ordered field and G is the set of (a,b) in F^2
with a nonzero orderded lexicographicly such that
(a,b)(c,d)=(ac,b+ad) (think of composing maps x-->ax+b).
Then G is an ordered group and it is non-abelian.

More information about the FOM mailing list