On Comparison of Finite Algebras
From MaRDI portal
Publication:5809228
DOI10.2307/2032452zbMath0046.03102OpenAlexW4247123734MaRDI QIDQ5809228
No author found.
Publication date: 1952
Full work available at URL: https://doi.org/10.2307/2032452
Related Items (9)
Complexity of the identity checking problem for finite semigroups. ⋮ An equational logic sampler ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ IDENTITIES IN BRANDT SEMIGROUPS, REVISITED ⋮ Algorithms for finding matrix models of propositional calculi ⋮ A minimal nonfinitely based semigroup whose variety is polynomially recognizable. ⋮ A field guide to equational logic ⋮ Word problems ⋮ The logical investigations of jan kalicki
This page was built for publication: On Comparison of Finite Algebras
