Finite bases for flat graph algebras

DOI10.1006/jabr.2001.8947zbMath0994.08004OpenAlexW1978813353MaRDI QIDQ5956274

Dejan Delić

Publication date: 2 October 2002

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

Full work available at URL: https://doi.org/10.1006/jabr.2001.8947

zbMATH Keywords

semilatticegraph algebraequational theoryfinitely based algebraflat algebra

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Graph theory (05C99) Structure theory of algebraic structures (08A05) Equational classes, universal algebra in model theory (03C05)

Related Items (5)

The Division Relation: Congruence Conditions and Axiomatisability ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ A NONFINITELY BASED FINITE SEMIRING ⋮ Flat algebras and the translation of universal Horn logic to equational logic ⋮ EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A field guide to equational logic
• Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
• On McKenzie's method
• THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• A finite basis theorem for residually finite, congruence meet-semidistributive varieties

This page was built for publication: Finite bases for flat graph algebras