Algorithms for categorical equivalence

  title={Algorithms for categorical equivalence},
  • C L I F F O R D B E R G M A N, J O E L B E R M
  • Published 1996
This paper provides an algorithm that, given two finite algebras A and B each of arbitrary finite similarity type, determines whether or not A and B are categorically equivalent. Although the algorithm is not practical in general, we consider some conditions on the algebras that improve its performance. There are several natural equivalence relations that can be imposed upon the space of algebraic structures. At one extreme is isomorphism of algebras. But other relations, such as elementary… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
9 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

An algebraic version of categorical equivalence for varieties and more general algebraic categories

  • P. Agliano
  • Lecture Notes in Pure and Applied Mathematics
  • 1996

Category equivalences of clones

  • K. Denecke, O. Lüders
  • Algebra Universalis
  • 1995
1 Excerpt

Computers and universal algebra : some directions

  • S. Burris
  • Algebra Universalis
  • 1995
1 Excerpt

The Structure of Finite Algebras

  • D. Hobby, R. McKenzie
  • 1988

The Lattice of Interpretability Types of Varieties

  • O. C. Garcia, W. Taylor
  • Memoirs of the Amer
  • 1984
1 Excerpt

The computational complexity of some problems in universal algebra

  • O. Lüders
  • 1984

A note on isomorphic varieties Comment

  • J. Kalicki
  • Math . Univ . Carolin .
  • 1982

On comparison of finite algebras Proc

  • K. A. Kearnes
  • Amer . Math . Soc .
  • 1952

Similar Papers

Loading similar papers…