11 research outputs found

    Lattice ordered binary systems

    Get PDF

    Neutrosophic Multi-Criteria Decision Making

    Get PDF
    The notion of a neutrosophic quadruple BCK/BCI-number is considered in the first article (“Neutrosophic Quadruple BCK/BCI-Algebras”, by Young Bae Jun, Seok-Zun Song, Florentin Smarandache, and Hashem Bordbar), and a neutrosophic quadruple BCK/BCI-algebra, which consists of neutrosophic quadruple BCK/BCI-numbers, is constructed. Several properties are investigated, and a (positive implicative) ideal in a neutrosophic quadruple BCK-algebra and a closed ideal in a neutrosophic quadruple BCI-algebra are studied. Given subsets A and B of a BCK/BCI-algebra, the set NQ(A,B), which consists of neutrosophic quadruple BCK/BCInumbers with a condition, is established. Conditions for the set NQ(A,B) to be a (positive implicative) ideal of a neutrosophic quadruple BCK-algebra are provided, and conditions for the set NQ(A,B) to be a (closed) ideal of a neutrosophic quadruple BCI-algebra are given. Techniques for the order of preference by similarity to ideal solution (TOPSIS) and elimination and choice translating reality (ELECTRE) are widely used methods to solve multicriteria decision-making problems. In the second research article (“Decision-Making with Bipolar Neutrosophic TOPSIS and Bipolar Neutrosophic ELECTRE-I”), Muhammad Akram, Shumaiza, and Florentin Smarandache present the bipolar neutrosophic TOPSIS method and the bipolar neutrosophic ELECTRE-I method to solve such problems. The authors use the revised closeness degree to rank the alternatives in the bipolar neutrosophic TOPSIS method. The researchers describe the bipolar neutrosophic TOPSIS method and the bipolar neutrosophic ELECTRE-I method by flow charts, also solving numerical examples by the proposed methods and providing a comparison of these methods. In the third article (“Interval Neutrosophic Sets with Applications in BCK/BCI-Algebra”, by Young Bae Jun, Seon Jeong Kim and Florentin Smarandache), the notion of (T(i,j),I(k,l),F(m,n))-interval neutrosophic subalgebra in BCK/BCI-algebra is introduced for i,j,k,l,m,n infoNumber 1,2,3,4, and properties and relations are investigated. The notion of interval neutrosophic length of an interval neutrosophic set is also introduced, and the related properties are investigated

    Collected Papers (on Neutrosophic Theory and Its Applications in Algebra), Volume IX

    Get PDF
    This ninth volume of Collected Papers includes 87 papers comprising 982 pages on Neutrosophic Theory and its applications in Algebra, written between 2014-2022 by the author alone or in collaboration with the following 81 co-authors (alphabetically ordered) from 19 countries: E.O. Adeleke, A.A.A. Agboola, Ahmed B. Al-Nafee, Ahmed Mostafa Khalil, Akbar Rezaei, S.A. Akinleye, Ali Hassan, Mumtaz Ali, Rajab Ali Borzooei , Assia Bakali, Cenap Özel, Victor Christianto, Chunxin Bo, Rakhal Das, Bijan Davvaz, R. Dhavaseelan, B. Elavarasan, Fahad Alsharari, T. Gharibah, Hina Gulzar, Hashem Bordbar, Le Hoang Son, Emmanuel Ilojide, Tèmítópé Gbóláhàn Jaíyéolá, M. Karthika, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Huma Khan, Madad Khan, Mohsin Khan, Hee Sik Kim, Seon Jeong Kim, Valeri Kromov, R. M. Latif, Madeleine Al-Tahan, Mehmat Ali Ozturk, Minghao Hu, S. Mirvakili, Mohammad Abobala, Mohammad Hamidi, Mohammed Abdel-Sattar, Mohammed A. Al Shumrani, Mohamed Talea, Muhammad Akram, Muhammad Aslam, Muhammad Aslam Malik, Muhammad Gulistan, Muhammad Shabir, G. Muhiuddin, Memudu Olaposi Olatinwo, Osman Anis, Choonkil Park, M. Parimala, Ping Li, K. Porselvi, D. Preethi, S. Rajareega, N. Rajesh, Udhayakumar Ramalingam, Riad K. Al-Hamido, Yaser Saber, Arsham Borumand Saeid, Saeid Jafari, Said Broumi, A.A. Salama, Ganeshsree Selvachandran, Songtao Shao, Seok-Zun Song, Tahsin Oner, M. Mohseni Takallo, Binod Chandra Tripathy, Tugce Katican, J. Vimala, Xiaohong Zhang, Xiaoyan Mao, Xiaoying Wu, Xingliang Liang, Xin Zhou, Yingcang Ma, Young Bae Jun, Juanjuan Zhang

    Acta Scientiarum Mathematicarum : Tomus XXV. Fasc. 1-2.

    Get PDF

    Fuzzy Mathematics

    Get PDF
    This book provides a timely overview of topics in fuzzy mathematics. It lays the foundation for further research and applications in a broad range of areas. It contains break-through analysis on how results from the many variations and extensions of fuzzy set theory can be obtained from known results of traditional fuzzy set theory. The book contains not only theoretical results, but a wide range of applications in areas such as decision analysis, optimal allocation in possibilistics and mixed models, pattern classification, credibility measures, algorithms for modeling uncertain data, and numerical methods for solving fuzzy linear systems. The book offers an excellent reference for advanced undergraduate and graduate students in applied and theoretical fuzzy mathematics. Researchers and referees in fuzzy set theory will find the book to be of extreme value

    Discrete Mathematics and Symmetry

    Get PDF
    Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group

    Acta Scientiarum Mathematicarum : Tomus XXVII. Fasc. 1-2.

    Get PDF

    The word problem for one-relation monoids: a survey

    Get PDF
    This survey is intended to provide an overview of one of the oldest and most celebrated open problems in combinatorial algebra: the word problem for one-relation monoids. We provide a history of the problem starting in 1914, and give a detailed overview of the proofs of central results, especially those due to Adian and his student Oganesian. After showing how to reduce the problem to the left cancellative case, the second half of the survey focuses on various methods for solving partial cases in this family. We finish with some modern and very recent results pertaining to this problem, including a link to the Collatz conjecture. Along the way, we emphasise and address a number of incorrect and inaccurate statements that have appeared in the literature over the years. We also fill a gap in the proof of a theorem linking special inverse monoids to one-relation monoids, and slightly strengthen the statement of this theorem

    Acta Scientiarum Mathematicarum : Tomus 31. Fasc. 3-4.

    Get PDF
    corecore