Finite bases for flat graph algebras

DOI10.1006/jabr.2001.8947zbMath0994.08004MaRDI 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

semilattice; graph algebra; equational theory; finitely based algebra; flat algebra

Mathematics Subject Classification ID

08B05: Equational logic, Mal'tsev conditions

05C99: Graph theory

08A05: Structure theory of algebraic structures

03C05: Equational classes, universal algebra in model theory

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item