Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

Generalization of Pawlak’s Approximations in Hypermodules by Set-Valued Homomorphisms

Authors

Year of publication

2017

Published in

Foundations of Computing and Decision Sciences

Journal year: 2017 | Journal volume: vol. 42 | Journal number: no. 1

Article type

scientific article

Publication language

english

Keywords
EN
  • approximation space
  • hypermodule
  • set-valued homomorphism
Abstract

EN The initiation and majority on rough sets for algebraic hyperstructures such as hypermodules over a hyperring have been concentrated on a congruence relation. The congruence relation, however, seems to restrict the application of the generalized rough set model for algebraic sets. In this paper, in order to solve this problem, we consider the concept of set-valued homomorphism for hypermodules and we give some examples of set-valued homomorphism. In this respect, we show that every homomorphism of the hypermodules is a set-valued homomorphism. The notions of generalized lower and upper approximation operators, constructed by means of a set-valued mapping, which is a generalization of the notion of lower and up-per approximations of a hypermodule, are provided. We also propose the notion of generalized lower and upper approximations with respect to a subhypermodule of a hypermodule discuss some significant properties of them.

Pages (from - to)

59 - 81

DOI

10.1515/fcds-2017-0003

URL

https://www.sciendo.com/article/10.1515/fcds-2017-0003

License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Full text of article

Download file

Access level to full text

public

Ministry points / journal

15

Ministry points / journal in years 2017-2021

15

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.