"semilattice" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "lattice"
      },
      "expansion": "semi- + lattice",
      "name": "prefix"
    }
  ],
  "etymology_text": "semi- + lattice",
  "forms": [
    {
      "form": "semilattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "semilattice (plural semilattices)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with semi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent."
      ],
      "id": "en-semilattice-en-noun-UIOLCT3a",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "join",
          "join"
        ],
        [
          "meet",
          "meet"
        ],
        [
          "underlying set",
          "underlying set"
        ],
        [
          "idempotent",
          "idempotent"
        ],
        [
          "Vaughan Pratt",
          "w:Vaughan Pratt"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "semilattice"
      ]
    }
  ],
  "word": "semilattice"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "lattice"
      },
      "expansion": "semi- + lattice",
      "name": "prefix"
    }
  ],
  "etymology_text": "semi- + lattice",
  "forms": [
    {
      "form": "semilattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "semilattice (plural semilattices)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with semi-",
        "en:Mathematics"
      ],
      "glosses": [
        "A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "join",
          "join"
        ],
        [
          "meet",
          "meet"
        ],
        [
          "underlying set",
          "underlying set"
        ],
        [
          "idempotent",
          "idempotent"
        ],
        [
          "Vaughan Pratt",
          "w:Vaughan Pratt"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "semilattice"
      ]
    }
  ],
  "word": "semilattice"
}