.png){kind=icon}
.png){kind=icon}
Return
The P-sets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2024.109244.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Starting from a poset P and a set A, we introduce P-sets as a natural generalization of Omega-sets. A P-set on A is defined by adding to A a special map from A(2 )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:
Poset
Centralized closure system
Weak equivalences
Cut sets
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W