Meet Operations

Meet Operations is a binary operation in order theory that, for any two elements in a partially ordered set, yields their greatest lower bound, thereby uniquely identifying the highest element that is less than or equal to both operands with respect to the partial order.

13

Publications

894

Citations

27

Authors

12

Institutions

Publications per year

2017–2026

0

Variants

Greatest Lower BoundsInfima

Authors

27

  1. RJ
    Robert John

    De Montfort University, United Kingdom

    2 publications · 53 citations

    2

    h-index

  2. GS
    G. Szász

    1 publications · 254 citations

    1

    h-index

  3. DE
    D. E. Rutherford

    University of St Andrews, United Kingdom

    1 publications · 67 citations

    1

    h-index

  4. AF
    Alden F. Pixley

    Harvey Mudd College, United States

    1 publications · 67 citations

    1

    h-index

  5. SL
    Sifeng Liu

    Nanjing University of Aeronautics and Astronautics, China

    1 publications · 11 citations

    1

    h-index

1–5 of 27

Venues

  1. American Mathematical Monthly

    2 publications · 321 citations

    2

    h-index

  2. 2

    h-index

  3. Journal of Symbolic Logic

    1 publications · 39 citations

    1

    h-index

  4. International Journal of Pure and Apllied Mathematics

    IJPAM · 1 publications · 13 citations

    1

    h-index

  5. Choice Reviews Online

    CRO · 1 publications · 148 citations

    1

    h-index

1–5