LEFT-ORDERABLE COMPUTABLE GROUPS
Matthew Harrison‐Trainor · Journal of Symbolic Logic · 2018
Abstract Downey and Kurtz asked whether every orderable computable group is classically isomorphic to a group with a computable ordering. By an order on a group, one might mean either a left-order or a bi-order. We answer their question for left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order. The case of bi-orderable groups is left open.