On the uniform word problem for lattices

IF 0.4 4区数学 Q3 MATHEMATICS

Algebra Universalis Pub Date : 2026-04-03 DOI:10.1007/s00012-026-00930-1

C. J. Van Alten

引用次数: 0

Abstract

An algorithm that decides the uniform word problem for lattices is given and shown to have \(O(n^3)\) running-time, which also gives an \(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.

查看原文本刊更多论文

关于格的一致字问题

给出了一种确定格的一致字问题的算法，并证明该算法具有\(O(n^3)\)运行时间，同时给出了格的拟方程理论的\(O(n^3)\)算法。从1920年的Skolem开始，这个结果延续了一长串解决这个问题的算法。该算法使用Cosmadakis算法解决统一词问题，使用Freese算法解决自由格的词问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Algebra Universalis 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3 months

期刊介绍： Algebra Universalis publishes papers in universal algebra, lattice theory, and related fields. In a pragmatic way, one could define the areas of interest of the journal as the union of the areas of interest of the members of the Editorial Board. In addition to research papers, we are also interested in publishing high quality survey articles.