A CATEGORICAL APPROACH OF FDT FOR Ω-MONOIDS

  • Jollanda Shara University “Eqrem Cabej”, 6001, Gjirokaster, Albania
Keywords: Ω-monoid, FDT, presentation, category, 2-congruence

Abstract

In this paper we generalize the results of [1] in the case of -monoids. The results we present here are obtained using some concepts of category theory and from a geometric viewpoint. So the proofs are shorter and more simple. The main result is that of Theorem 6.3. which states that if  an -monoid  has a finite canonical presentation, then   has FDT   

Downloads

Download data is not yet available.

Author Biography

Jollanda Shara, University “Eqrem Cabej”, 6001, Gjirokaster, Albania

Department of Mathematics&Computer Science, University “Eqrem Cabej”, 6001,
Gjirokaster, Albania.

References

1. Y.Lafont,(1994), A new finiteness condition for monoids presented by complete rewriting systems (after Craig C.Squier).
2. Saunders Mac Lane,(1998), Categories for the Working Mathematician, Second Edition.
3. P.A.Grillet, (2007), Abstract Algebra.
4. C.C.Squier, F.Otto,Y.Kobayashi, (1994), A finiteness condition for rewriting systems, Theoretical Computer Science,131, 271-294.
5. C.Squier, (1987), Word problems and a homological finiteness condition for monoids, Journal of Pure and Applied Algebra 49, 201-217.
6. J. Shara,(2018) FDT for Ω-monoids, EPH-International Journal of Mathematics and Statistics, Vol 4 No 7 .
7. Y.Lafont, (2006), Algebra and Geometry of Rewriting.
8. A.Burroni, (1993), Higher Dimensional Word Problem, Theoretical Computer Science 115, 43-62.
Published
2019-02-25
How to Cite
Shara, J. (2019). A CATEGORICAL APPROACH OF FDT FOR Ω-MONOIDS. EPH - International Journal of Mathematics and Statistics (ISSN: 2208-2212), 5(2), 01-12. Retrieved from https://ephjournal.com/index.php/ms/article/view/1174