Ordered Groups, Computability and Cantor-Bendixson Rank

Abstract

AbstractWe study ordered groups in the context of both algebra and computability. Ordered groups are groups that admit a linear order that is compatible with the group operation. We explore some properties of ordered groups and discuss some related topics. We prove results about the semidirect product in relation to orderability and computability. In particular, we give a criteria for when a semidirect product of orderable groups is orderable and for when a semidirect product is computably categorical. We also give an example of a semidirect product that has the halting set coded into its multiplication structure but it is possible to construct a computable presentation of this semidirect product.We examine a family of orderable groups that admit exactly countably many orders and show that their space of orders has arbitrary finite Cantor–Bendixson rank. Furthermore, this family of groups is also shown to be computably categorical, which in particular will allow us to conclude that any computable presentation of the groups does not admit any noncomputable orders. Lastly, we construct an example of an orderable computable group with no computable Archimedean orders but at least one computable non-Archimedean order.Abstract prepared by Waseet Kazmi.E-mail: waseet.kazmi@uconn.eduURL: http://hdl.handle.net/11134/20002:860745910