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

DOI10.1007/BF01190431zbMATH Open0549.08003OpenAlexW1965273337MaRDI QIDQ800399FDOQ800399

Gábor Czédli, Alan Day

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

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

Cites Work

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

Cited In (7)

• The shape of congruence lattices
• Lattices freely generated by an order and preserving certain bounds
• Mal'cev conditions corresponding to identities for compatible reflexive relations
• Obituary: R. Alan Day
• Commutator equations
• Mal'cev conditions for Horn sentences with congruence permutability
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800399)