Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-25T10:56:08.354Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithms for categorical equivalence

Published online by Cambridge University Press:  01 February 1998

CLIFFORD BERGMAN  and
JOEL BERMAN
CLIFFORD BERGMAN
Affiliation:
Department of Mathematics, Iowa State University, Ames, Iowa 50011–2066 USA. Email: cbergman@@iastate.edu
JOEL BERMAN
Affiliation:
Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 S. Morgan (m/c 249), Chicago, Illinois 60607–7045 USA. Email: jberman@@uic.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 8 , Issue 1 , February 1998 , pp. 1 - 15
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)