Horn sentences with (W) and weak Mal'cev conditions

DOI10.1007/BF01190431zbMath0549.08003OpenAlexW1965273337MaRDI QIDQ800399

Alan Day, Gábor Czédli

Publication date: 1984

Published in: Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

Pixley-Wille algorithmstrong Mal'cev conditionsuniversal lattice Horn sentenceweak Mal'cev conditionsWhitman condition

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Subalgebras, congruence relations (08A30) Free lattices, projective lattices, word problems (06B25)

Related Items (6)

Unnamed Item ⋮ Lattices freely generated by an order and preserving certain bounds ⋮ Mal'cev conditions corresponding to identities for compatible reflexive relations ⋮ Obituary: R. Alan Day ⋮ The shape of congruence lattices ⋮ Mal'cev conditions for Horn sentences with congruence permutability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing Mal'cev conditions
• Splitting lattices generate all lattices
• A test for identities satisfied in lattices of submodules
• Free lattices
• On Malcev conditions
• A Simple Solution to the Word Problem for Lattices
• Local Malcev Conditions
• Equational Bases and Nonmodular Lattice Varieties
• Free Lattices Generated by Partially Ordered Sets and Preserving Bounds
• Lattices, equivalence relations, and subgroups

This page was built for publication: Horn sentences with (W) and weak Mal'cev conditions