Partially Ordered Sets
Partially Ordered Sets is a mathematical structure consisting of a set equipped with a binary relation that is reflexive, antisymmetric, and transitive, thereby formalizing the notion of order among elements where not all pairs need be comparable.
2.2K
Publications
103.1K
Citations
2.8K
Authors
1.2K
Institutions
Publications per year
2017–2026
127
2.2K
Similarity relations and fuzzy orderings
Lotfi A. Zadeh · Information Sciences · 1971 · 2.6K citations
A procedure for ordering fuzzy subsets of the unit interval
Ronald R. Yager · Information Sciences · 1981 · 1.4K citations
1–5 of 2.2K
2.8K
16
h-index
15
h-index
12
h-index
11
h-index
10
h-index
1–5 of 2.8K
1.2K

Ghent University
Ghent, Belgium
20 h-index
50 publications
4.2K citations
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
38 publications
1.4K citations

University of Calgary
Calgary, Canada
16 h-index
38 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
44 publications
2.8K citations
University of California, Berkeley
Berkeley, United States
15 h-index
26 publications
3.9K citations
AT&T (United States)
Bedminster, United States
15 h-index
22 publications
1.3K citations
Université Paris Cité
Paris, France
15 h-index
22 publications
1.9K citations
Hebrew University of Jerusalem
Jerusalem, Israel
15 h-index
23 publications
1K citations
1–8 of 1.2K
TRAN · 58 publications · 4.6K citations
31
h-index
72 publications · 4.2K citations
30
h-index
43 publications · 2.5K citations
28
h-index
74 publications · 2.6K citations
28
h-index
35 publications · 1.6K citations
26
h-index
1–5