"bilattice" meaning in English

See bilattice in All languages combined, or Wiktionary

Noun

Forms: bilattices [plural]
Etymology: bi- + lattice Etymology templates: {{prefix|en|bi|lattice}} bi- + lattice Head templates: {{en-noun}} bilattice (plural bilattices)
  1. (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. Categories (topical): Computing, Mathematics

Inflected forms

Download JSON data for bilattice meaning in English (2.6kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "bi",
        "3": "lattice"
      },
      "expansion": "bi- + lattice",
      "name": "prefix"
    }
  ],
  "etymology_text": "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": "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 #x7B;#x5C;mathcalM#x7D;#x5C;subseteq#x7B;#x5C;mathcalB#x7D;(H#x5F;1,H#x5F;2) the following assertions are equivalent. (i) #x7B;#x5C;mathcalM#x7D; is reflexive in the sense of Loginov--Shulman. (ii) There exists an order-preserving map 1 on a bilattice Bil(#x7B;#x5C;mathcalM#x7D;) of subspaces determined by #x7B;#x5C;mathcalM#x7D;, with P#x5C;leq#x5C;psi#x5F;1(P,Q) and Q#x5C;leq#x5C;psi#x5F;2(P,Q), for any pair (P,Q)#x5C;inBil(#x7B;#x5C;mathcalM#x7D;), and such that an operator T#x5C;in#x7B;#x5C;mathcalB#x7D;(H#x5F;1,H#x5F;2) lies in #x7B;#x5C;mathcalM#x7D; if and only if #x5C;psi#x5F;2(P,Q)T#x5C;psi#x5F;1(P,Q)#x3D;0 for all (P,Q)#x5C;inBil(#x7B;#x5C;mathcalM#x7D;).",
          "type": "quotation"
        }
      ],
      "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": "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",
        "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 #x7B;#x5C;mathcalM#x7D;#x5C;subseteq#x7B;#x5C;mathcalB#x7D;(H#x5F;1,H#x5F;2) the following assertions are equivalent. (i) #x7B;#x5C;mathcalM#x7D; is reflexive in the sense of Loginov--Shulman. (ii) There exists an order-preserving map 1 on a bilattice Bil(#x7B;#x5C;mathcalM#x7D;) of subspaces determined by #x7B;#x5C;mathcalM#x7D;, with P#x5C;leq#x5C;psi#x5F;1(P,Q) and Q#x5C;leq#x5C;psi#x5F;2(P,Q), for any pair (P,Q)#x5C;inBil(#x7B;#x5C;mathcalM#x7D;), and such that an operator T#x5C;in#x7B;#x5C;mathcalB#x7D;(H#x5F;1,H#x5F;2) lies in #x7B;#x5C;mathcalM#x7D; if and only if #x5C;psi#x5F;2(P,Q)T#x5C;psi#x5F;1(P,Q)#x3D;0 for all (P,Q)#x5C;inBil(#x7B;#x5C;mathcalM#x7D;).",
          "type": "quotation"
        }
      ],
      "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"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-06-04 from the enwiktionary dump dated 2024-05-02 using wiktextract (e9e0a99 and db5a844). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.