Complete Lattices

Complete Lattices is a mathematical structure in order theory consisting of a partially ordered set in which every subset has both a supremum (least upper bound) and an infimum (greatest lower bound).

541

Publications

17.8K

Citations

718

Authors

392

Institutions

Publications per year

2017–2026

42

Authors

718

  1. XW
    Xue-ping Wang

    Sichuan Normal University, China

    9 publications · 202 citations

    9

    h-index

  2. IR
    Ivan Rival

    University of Calgary, Canada

    8 publications · 155 citations

    8

    h-index

  3. GG
    George Grätzer

    University of Manitoba, Canada

    8 publications · 141 citations

    8

    h-index

  4. ZW
    Zhudeng Wang

    Yancheng Teachers University, China

    7 publications · 259 citations

    7

    h-index

  5. GN
    George N. Raney

    University of Connecticut, United States

    6 publications · 469 citations

    6

    h-index

1–5 of 718

Venues

  1. Pacific Journal of Mathematics

    23 publications · 936 citations

    21

    h-index

  2. Fuzzy Sets and Systems

    27 publications · 881 citations

    18

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 28 publications · 688 citations

    17

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 21 publications · 668 citations

    13

    h-index

  5. Algebra Universalis

    17 publications · 515 citations

    12

    h-index

1–5