Isomorphism Testing for Orthomodular Lattices

• Autorzy: Tomasz Gorazd , Paweł Idziak
• Języki publikacji: EN

Abstrakty

EN

We show that the computational complexity of the isomorphism testing of orthomodular lattices is polynomially equivalent to the graph isomorphism testing. (original abstract)

Słowa kluczowe

EN

Isomorphism; Algebra

PL

Izomorfizm; Algebra

• Czasopismo: Nowy Sącz Academic Review
• Rocznik: 2005
• Tom: 2
• Strony: 86--92

Twórcy

autor

Tomasz Gorazd

• Wyższa Szkoła Biznesu - National-Louis University in Nowy Sącz, Poland

autor

Paweł Idziak

• Wyższa Szkoła Biznesu - National-Louis University in Nowy Sącz, Poland

Bibliografia

• [1] S.Burris and H.P.Sankappanavar, A Course in Universal Algebra, Springer Verlag 1981.
• [2] T.A.Gorazd, Fast isomorphism testing in arithmetical varieties, International Journal of Algebra and Computation, 13(2003), 499-506.
• [3] T.A.Gorazd, The isomorphism testing for directly representable varieties, Reports on Mathematical Logic, 31(1997), 75-92.
• [4] T.A.Gorazd and P.M.Idziak, The isomorphism problem for varieties generated by a two-element algebra, Algebra Universalis, 34(1995), 430-439.
• [5] G.Kalmbach, Orthomodular Lattices, Academic Press, 1983.
• [6] D.Kozen, Complexity of finitely presented algebras, Proc. 9th Symposium STOC (1977), 164-177.
• [7] R.McKenzie, G.McNulty and W.Taylor, Algebras, Lattices, and Varieties. Vol. I. Wadsworth and Brooks/Cole, Mathematics Series, 1987.
• [8] M.Sherif, Decision problem for orthomodular lattices, Algebra Universalis, 37(1997), 70-76.