arXiv Analytics

Sign in

arXiv:1503.03192 [math.LO]AbstractReferencesReviewsResources

Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups

Murray Neuzerling

Published 2015-03-11Version 1

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with respect to a universal relation, this result can be extended to infinite representations of ordered complemented semigroups.

Categories: math.LO
Subjects: 03G15
Related articles: Most relevant | Search more
arXiv:2306.16888 [math.LO] (Published 2023-06-29)
A new approach on distributed systems: orderings and representability
arXiv:1809.04670 [math.LO] (Published 2018-09-12)
Undecidability of $\mathbb Q^{(2)}$
arXiv:1906.09307 [math.LO] (Published 2019-06-21)
Representability and Compactness for Pseudopowers

Links

Toolbox