Algorithm decides the uniform word problem in lattices, indicating efficiency for theoretical research.
An algorithm that decides the uniform word problem for lattices is given and shown to have O(n³) O ( n 3 ) running-time, which also gives an O(n³) O ( n 3 ) algorithm for the quasi-equational theory of lattices. This result continues a long sequence of algorithms for this problem, starting with Skolem in 1920. The algorithm makes use of Cosmadakis’ algorithm for the uniform word problem and Freese’s algorithm for the word problem for free lattices.
No takes yet. Share an insight, caveat, or question.
C. J. Van Alten (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: