Authors: Horváth, Eszter K.
Kwuida, Leonard
Šešelja, Branimir
Tepavčević, Andreja 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: P-sets
Journal: Fuzzy Sets and Systems
Volume: 503
First page: 109244
Issue Date: 2025
Rank: M21a+
ISSN: 0165-0114
DOI: 10.1016/j.fss.2024.109244
Abstract: 
Starting from a poset P and a set A, we introduce P-sets as a natural generalization of Ω-sets. A P-set on A is defined by adding to A a special map from A2 to P, which generalizes the classical equality relation. We prove that P-sets on A are naturally obtained from centralized closure systems in a family of all weak equivalences on A. Moreover, for every P-set there is a canonical representation in which the used centralized closure system replaces the poset P. Further, we present a classification of all P-sets by the family of cuts, where A and P are fixed. Different P-sets may have equal collections of cut sets. Necessary and sufficient conditions under which this happens are presented; i.e., all P-sets are classified according to the equality of collections of cut sets.
Keywords: Centralized closure system | Cut sets | Poset | Weak equivalences
Publisher: Elsevier

Show full item record

Page view(s)

20
checked on Jan 29, 2026

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.