Orderings of algebraic structures on trees

Abstract: A partial left ordering or bi-ordering of an algebraic structure is a partial ordering of the elements of the structure, which is invariant under the structure acting on itself on the left or, respectively, both on the left and on the right. I will discuss algorithmic properties of the orderings admitted by a computable structure, and consider some general questions