Partial Ordering

Partial Ordering is a binary relation on a set that is reflexive, antisymmetric, and transitive, thereby establishing a hierarchical structure in which not all elements need be comparable.

1.1K

Publications

65.6K

Citations

1.9K

Authors

791

Institutions

Publications per year

2017–2026

86

Variants

Partial Order

Authors

1.9K

  1. XL
    Xiaoji Liu

    Guangxi Minzu University, China

    7 publications · 206 citations

    7

    h-index

  2. NK
    Niovi Kehayopulu

    National and Kapodistrian University of Athens, Greece

    7 publications · 261 citations

    7

    h-index

  3. PC
    Peter C. Fishburn

    AT&T (United States), United States

    6 publications · 268 citations

    7

    h-index

  4. TS
    Tôru Saitô

    The University of Osaka, Japan

    6 publications · 149 citations

    6

    h-index

  5. RM
    Ralph McKenzie

    University of California, Berkeley, United States

    5 publications · 132 citations

    5

    h-index

1–5 of 1.9K

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 28 publications · 1.5K citations

    20

    h-index

  2. Linear Algebra and its Applications

    15 publications · 645 citations

    14

    h-index

  3. Discrete Mathematics

    18 publications · 751 citations

    14

    h-index

  4. Fuzzy Sets and Systems

    15 publications · 533 citations

    14

    h-index

  5. Journal of Symbolic Logic

    20 publications · 607 citations

    14

    h-index

1–5