Dualizability and graph algebras
From MaRDI portal
Publication:1972139
DOI10.1016/S0012-365X(99)00225-3zbMath0945.08001MaRDI QIDQ1972139
George F. McNulty, William A. Lampe, Brian A. Davey, Paweł M. Idziak
Publication date: 22 June 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
natural dualitydualizabilityfinite graph algebrasfinitely axiomatizable equational theoryinherently nondualizablenondualizability
Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Graph theory (05C99) Structure theory of algebraic structures (08A05) Quasivarieties (08C15) Equational classes, universal algebra in model theory (03C05)
Related Items (12)
Naturally dualizable algebras omitting types 1 and 5 have a cube term ⋮ Two Algorithms For Languages Recognized By Graph Algebras ⋮ The algebra of metric betweenness. I: Subdirect representation and retraction ⋮ DUALIZABLE BUT NOT FULLY DUALIZABLE ALGEBRAS ⋮ Dualisability versus residual character: a theorem and a counterexample ⋮ Dualizability of automatic algebras. ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ Natural dualities, nilpotence and projective planes ⋮ DUALIZABILITY OF GRAPHS ⋮ DUALISABILITY OF FINITE SEMIGROUPS ⋮ The Complexity of Dualisability: Three-Element Unary Algebras ⋮ UNCOUNTABLY MANY DUALISABLE ALGEBRAS
This page was built for publication: Dualizability and graph algebras
