On the {↔, ∼} -reduct of the intuitionistic consequence operation
✍ Scribed by J. K. Kabziński; M. Porębska; A. Wroński
- Publisher
- Springer Netherlands
- Year
- 1981
- Tongue
- English
- Weight
- 670 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## In a previous result concerning Meyniel graphs, the authors defined an operation for composing graphs. This operation constructs from two graphs G1 and G2 a new graph G1 0 G2, called the amalgam of G1 and G2. If G1 and G2 are Meyniel graphs then G1 0 G2 is also a Meyniel graph. Similarly if G1
Fuzzy relations are able to model vagueness, in the sense that they provide the degree to which two objects are related to each other. However, they cannot model uncertainty: there is no means to attribute reliability information to the membership degrees. Intuitionistic fuzzy sets, as deÿned by Ata