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

Authors

2.8K

  1. BD
    Bernard De Baets

    Ghent University, Belgium

    21 publications · 689 citations

    16

    h-index

  2. PC
    Peter C. Fishburn

    AT&T (United States), United States

    20 publications · 637 citations

    15

    h-index

  3. IR
    Ivan Rival

    University of Calgary, Canada

    17 publications · 654 citations

    12

    h-index

  4. DD
    Dwight Duffus

    Emory University, United States

    12 publications · 418 citations

    11

    h-index

  5. HD
    H. De Meyer

    Ghent University, Belgium

    11 publications · 359 citations

    10

    h-index

1–5 of 2.8K

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 58 publications · 4.6K citations

    31

    h-index

  2. Fuzzy Sets and Systems

    72 publications · 4.2K citations

    30

    h-index

  3. Theoretical Computer Science

    43 publications · 2.5K citations

    28

    h-index

  4. Discrete Mathematics

    74 publications · 2.6K citations

    28

    h-index

  5. Pacific Journal of Mathematics

    35 publications · 1.6K citations

    26

    h-index

1–5