Computing on lattice-ordered abelian groups

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Starting from a classical theorem of Gurevich and Kokorin we survey recent diverging developments of the theories of lattice-ordered abelian groups and their counterparts equipped with a distinguished order unit. We will focus on decision and recognition problems. As an application of Elliott’s classification, we will touch on word problems of AF C*-algebras.

Cite

CITATION STYLE

APA

Mundici, D. (2020). Computing on lattice-ordered abelian groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12180 LNCS, pp. 210–225). Springer. https://doi.org/10.1007/978-3-030-48006-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free