Abstract
The general problem of testing the isomorphism of two given finite algebras is known to be isomorphism complete, i.e. polynomially equivalent to the graph isomorphism problem (GI). It is easy to see that this fact still holds when sorts are introduced. However, this isomorphism problem is relevant only for algebras (or interpretations) of a fixed signature, and in some cases, according to the signature, is much simpler than the general problem. We therefore establish exactly for which signatures is the associated isomorphism problem simpler than GI, and for which is it isomorphism complete. It turns out that for non-monadic signatures, this problem is isomorphism complete just as is the case without sorts, while the classification of monadic signatures is more complex and interesting in the presence of sorts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, California, 1979.
C. Hoffmann. Group-theoretic algorithms and graph isomorphism. Lecture Notes in Computer Science 136. Springer Verlag, 1981.
Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164–177, Boulder, Colorado, 2–4 May 1977.
Gary L. Miller. Graph isomorphism, general remarks. Journal of Computer and System Sciences, 18:128–142, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Tour, T.B. (2000). On the Complexity of Finite Sorted Algebras. In: Caferra, R., Salzer, G. (eds) Automated Deduction in Classical and Non-Classical Logics. FTP 1998. Lecture Notes in Computer Science(), vol 1761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46508-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-46508-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67190-9
Online ISBN: 978-3-540-46508-9
eBook Packages: Springer Book Archive