"bilattice" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "bi",
        "3": "lattice"
      },
      "expansion": "bi- + lattice",
      "name": "prefix"
    }
  ],
  "etymology_text": "From bi- + lattice.",
  "forms": [
    {
      "form": "bilattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bilattice (plural bilattices)",
      "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 bi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Janko Bračič, Lina Oliveira, “A characterization of reflexive spaces of operators”, in arXiv:",
          "text": "We show that for a linear space of operators #123;#92;mathcalM#125;#92;subseteq#123;#92;mathcalB#125;(H#95;1,H#95;2) the following assertions are equivalent. (i) #123;#92;mathcalM#125; is reflexive in the sense of Loginov--Shulman. (ii) There exists an order-preserving map 1 on a bilattice Bil(#123;#92;mathcalM#125;) of subspaces determined by #123;#92;mathcalM#125;, with P#92;leq#92;psi#95;1(P,Q) and Q#92;leq#92;psi#95;2(P,Q), for any pair (P,Q)#92;inBil(#123;#92;mathcalM#125;), and such that an operator T#92;in#123;#92;mathcalB#125;(H#95;1,H#95;2) lies in #123;#92;mathcalM#125; if and only if #92;psi#95;2(P,Q)T#92;psi#95;1(P,Q)#61;0 for all (P,Q)#92;inBil(#123;#92;mathcalM#125;).",
          "type": "quote"
        }
      ],
      "glosses": [
        "A structure B = (S,⊑₁ ,⊑₂) in which S is a non-empty set, and ⊑₁ and ⊑₂ are partial orderings each giving S the structure of a lattice, determining thus for each of the two lattices the corresponding operations of meet and join."
      ],
      "id": "en-bilattice-en-noun-gBiXkDfm",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing) A structure B = (S,⊑₁ ,⊑₂) in which S is a non-empty set, and ⊑₁ and ⊑₂ are partial orderings each giving S the structure of a lattice, determining thus for each of the two lattices the corresponding operations of meet and join."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "bilattice"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "bi",
        "3": "lattice"
      },
      "expansion": "bi- + lattice",
      "name": "prefix"
    }
  ],
  "etymology_text": "From bi- + lattice.",
  "forms": [
    {
      "form": "bilattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bilattice (plural bilattices)",
      "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 bi-",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computing",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Janko Bračič, Lina Oliveira, “A characterization of reflexive spaces of operators”, in arXiv:",
          "text": "We show that for a linear space of operators #123;#92;mathcalM#125;#92;subseteq#123;#92;mathcalB#125;(H#95;1,H#95;2) the following assertions are equivalent. (i) #123;#92;mathcalM#125; is reflexive in the sense of Loginov--Shulman. (ii) There exists an order-preserving map 1 on a bilattice Bil(#123;#92;mathcalM#125;) of subspaces determined by #123;#92;mathcalM#125;, with P#92;leq#92;psi#95;1(P,Q) and Q#92;leq#92;psi#95;2(P,Q), for any pair (P,Q)#92;inBil(#123;#92;mathcalM#125;), and such that an operator T#92;in#123;#92;mathcalB#125;(H#95;1,H#95;2) lies in #123;#92;mathcalM#125; if and only if #92;psi#95;2(P,Q)T#92;psi#95;1(P,Q)#61;0 for all (P,Q)#92;inBil(#123;#92;mathcalM#125;).",
          "type": "quote"
        }
      ],
      "glosses": [
        "A structure B = (S,⊑₁ ,⊑₂) in which S is a non-empty set, and ⊑₁ and ⊑₂ are partial orderings each giving S the structure of a lattice, determining thus for each of the two lattices the corresponding operations of meet and join."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing) A structure B = (S,⊑₁ ,⊑₂) in which S is a non-empty set, and ⊑₁ and ⊑₂ are partial orderings each giving S the structure of a lattice, determining thus for each of the two lattices the corresponding operations of meet and join."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "bilattice"
}