Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Orders on magmas and computability theory

    https://doi.org/10.1142/S0218216518410018Cited by:2 (Source: Crossref)
    This article is part of the issue:

    We investigate algebraic and computability-theoretic properties of orderable magmas. A magma is an algebraic structure with a single binary operation. A right order on a magma is a linear ordering of its domain, which is right-invariant with respect to the magma operation. We use tools of computability theory to investigate Turing complexity of orders on computable orderable magmas. A magma is computable if it is finite, or if its domain can be identified with the set of natural numbers and the magma operation is computable. Interesting orderable magmas that are not even associative come from knot theory.

    AMSC: 03D45, 03C57, 54D30