On the word problem of lattices with the help of graphs

DOI10.1007/BF02260393zbMath0756.06002OpenAlexW2065769240MaRDI QIDQ1182531

Gábor Czédli

Publication date: 28 June 1992

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02260393

zbMATH Keywords

algorithmword problemfinitely presented lattices

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Free lattices, projective lattices, word problems (06B25)

Related Items

Unnamed Item, Lattices freely generated by an order and preserving certain bounds, Symmetric embeddings of free lattices into each other, A Horn sentence for involution lattices of quasiorders, Proof theory for linear lattices

Cites Work

• Mal'cev conditions for Horn sentences with congruence permutability
• Free Lattices Generated by Partially Ordered Sets and Preserving Bounds
• The Word Problem for Abstract Algebras
• The decision problem for some classes of sentences without quantifiers