Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

382
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

125
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

THE REMAK-KRULL-SCHMIDT THEOREM ON FUZZY GROUPS

Pages

  153-159

Abstract

 In this paper we study a representation of a FUZZY SUBGROUP  m of a group  G, as a product of INDECOMPOSABLE FUZZY SUBGROUPs called the components of m. This representation is unique up to the number of components and their isomorphic copies. In the crisp group theory, this is a well-known Theorem attributed to Remak, Krull, and Schmidt. We consider the LATTICE of FUZZY SUBGROUPs and some of their properties to prove this theorem. We illustrate with some examples.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    MAKAMBA, B.B., & MURALI, V.. (2013). THE REMAK-KRULL-SCHMIDT THEOREM ON FUZZY GROUPS. IRANIAN JOURNAL OF FUZZY SYSTEMS, 10(6), 153-159. SID. https://sid.ir/paper/609245/en

    Vancouver: Copy

    MAKAMBA B.B., MURALI V.. THE REMAK-KRULL-SCHMIDT THEOREM ON FUZZY GROUPS. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2013;10(6):153-159. Available from: https://sid.ir/paper/609245/en

    IEEE: Copy

    B.B. MAKAMBA, and V. MURALI, “THE REMAK-KRULL-SCHMIDT THEOREM ON FUZZY GROUPS,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 10, no. 6, pp. 153–159, 2013, [Online]. Available: https://sid.ir/paper/609245/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top