On the word problem of lattices with the help of graphs (Q1182531): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Mal'cev conditions for Horn sentences with congruence permutability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Free Lattices Generated by Partially Ordered Sets and Preserving Bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Word Problem for Abstract Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The decision problem for some classes of sentences without quantifiers / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02260393 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065769240 / rank | |||
Normal rank | |||
Latest revision as of 12:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the word problem of lattices with the help of graphs |
scientific article |
Statements
On the word problem of lattices with the help of graphs (English)
0 references
28 June 1992
0 references
The aim of the present paper is to give a new algorithm for the word problem of finitely presented lattices. Although there are known algorithms solving this problem, our approach is entirely different and the result looks simpler.
0 references
algorithm
0 references
word problem
0 references
finitely presented lattices
0 references
