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
Parents
13
Introduction to Lattice Theory.
Öystein Ore, G. Szász · American Mathematical Monthly · 1965 · 254 citations
SociaLite: Datalog extensions for efficient social network analysis
Jiwon Seo, Sui Guo, Monica S. Lam · 2013 · 99 citations
Introduction to Lattice Theory.
Alden F. Pixley, D. E. Rutherford · American Mathematical Monthly · 1966 · 67 citations
1–5 of 13
27
2
h-index
1 publications · 254 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 27
12
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
27 citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
1 h-index
3 publications
33 citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
1 h-index
1 publications
33 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
33 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
33 citations
Stanford University
Stanford, United States
1 h-index
3 publications
297 citations

Gangneung–Wonju National University
Gangneung, South Korea
1 h-index
1 publications
13 citations
Institut für Regionale Innovation und Sozialforschung
Dresden, Germany
1 h-index
1 publications
33 citations
1–8 of 12
2 publications · 321 citations
2
h-index
2 publications · 60 citations
2
h-index
1 publications · 39 citations
1
h-index
IJPAM · 1 publications · 13 citations
1
h-index
CRO · 1 publications · 148 citations
1
h-index
1–5