Intuitionistic Neutrosophic Set Relations and Some of Its Properties
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-5-183,
author = {Monoranjan Bhowmik and Madhumangal Pal},
title = {Intuitionistic Neutrosophic Set Relations and Some of Its Properties},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {5},
number = {3},
pages = {183--192},
abstract = { In this paper, we define intuitionistic neutrosophic set (INSs). In fact, all INSs are neutrosophic
set but all neutrosophic sets are not INSs. We have shown by means of example that the definition for
neutrosophic sets the complement and union are not true for INSs also give new definition of complement,
union and intersection of INSs. We define the relation of INSs and four special type of INSs relations. Finally
we have studied some properties of INSs relations.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22709.html}
}
TY - JOUR
T1 - Intuitionistic Neutrosophic Set Relations and Some of Its Properties
AU - Monoranjan Bhowmik and Madhumangal Pal
JO - Journal of Information and Computing Science
VL - 3
SP - 183
EP - 192
PY - 2024
DA - 2024/01
SN - 5
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22709.html
KW - Neutrosophic sets, intuitionistic fuzzy sets, intuitionistic neutrosophic sets, intuitionistic
neutrosophic relations
AB - In this paper, we define intuitionistic neutrosophic set (INSs). In fact, all INSs are neutrosophic
set but all neutrosophic sets are not INSs. We have shown by means of example that the definition for
neutrosophic sets the complement and union are not true for INSs also give new definition of complement,
union and intersection of INSs. We define the relation of INSs and four special type of INSs relations. Finally
we have studied some properties of INSs relations.
Monoranjan Bhowmik and Madhumangal Pal. (2024). Intuitionistic Neutrosophic Set Relations and Some of Its Properties.
Journal of Information and Computing Science. 5 (3).
183-192.
doi:
Copy to clipboard