|
Organizers |
Order Relations on Computable Magmas
by
Trang Ha
GWU
Coauthors: Valentina Harizanov
A magma is computable if there is an algorithm to decide the membership of its elements and the magmas binary operation is computable. We discuss order relations on computable magmas. We will show conditions for a magma to be orderable, Turing degrees, and description of the space of orders. We also consider orderings on some examples of non associative magmas such as quandles and racks.
Date received: December 5, 2017
Copyright © 2017 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cboj-27.