"codisjoint" meaning in English

See codisjoint in All languages combined, or Wiktionary

Adjective

Etymology: From co- + disjoint. Etymology templates: {{af|en|co-|disjoint}} co- + disjoint Head templates: {{en-adj|-}} codisjoint (not comparable)
  1. (set theory) Of two or more sets, having an union equal to the universal set. Tags: not-comparable
    Sense id: en-codisjoint-en-adj-X~FMy4Ra Categories (other): Set theory, English entries with incorrect language header, English terms prefixed with co-, Pages with 1 entry, Pages with entries Disambiguation of English entries with incorrect language header: 91 9 Disambiguation of English terms prefixed with co-: 69 31 Disambiguation of Pages with 1 entry: 96 4 Disambiguation of Pages with entries: 97 3 Topics: mathematics, sciences, set-theory
  2. (algebra) Of two or more elements in a lattice, having a join equal to the top element. Tags: not-comparable
    Sense id: en-codisjoint-en-adj-hcyT41iB Categories (other): Algebra Topics: algebra, mathematics, sciences
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co-",
        "3": "disjoint"
      },
      "expansion": "co- + disjoint",
      "name": "af"
    }
  ],
  "etymology_text": "From co- + disjoint.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "codisjoint (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "langcode": "en",
          "name": "Set theory",
          "orig": "en:Set theory",
          "parents": [],
          "source": "w"
        },
        {
          "_dis": "91 9",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "69 31",
          "kind": "other",
          "name": "English terms prefixed with co-",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "96 4",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "97 3",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "Of two or more sets, having an union equal to the universal set."
      ],
      "id": "en-codisjoint-en-adj-X~FMy4Ra",
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "union",
          "union"
        ],
        [
          "universal set",
          "universal set"
        ]
      ],
      "raw_glosses": [
        "(set theory) Of two or more sets, having an union equal to the universal set."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences",
        "set-theory"
      ]
    },
    {
      "categories": [
        {
          "kind": "other",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              213,
              223
            ]
          ],
          "ref": "2007, Thierry Lucas, “Axioms for Action”, in Logique et Analyse, volume 50, number 200, page 384:",
          "text": "A word of caution however if you want to express the expected connections between these different supports. E.g., it is tempting to prove that S#95;0#123;#61;0#125;#92;alpha and S#95;0#123;#61;1#125;#92;alpha are codisjoint, i.e. that S#95;0#123;#61;0#125;#92;alpha#92;lorS#95;0#123;#61;1#125;#92;alpha#61;1.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Of two or more elements in a lattice, having a join equal to the top element."
      ],
      "id": "en-codisjoint-en-adj-hcyT41iB",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "element",
          "element"
        ],
        [
          "lattice",
          "lattice"
        ],
        [
          "join",
          "join"
        ],
        [
          "top",
          "top"
        ]
      ],
      "raw_glosses": [
        "(algebra) Of two or more elements in a lattice, having a join equal to the top element."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "codisjoint"
}
{
  "categories": [
    "English adjectives",
    "English entries with incorrect language header",
    "English lemmas",
    "English terms prefixed with co-",
    "English uncomparable adjectives",
    "Pages with 1 entry",
    "Pages with entries",
    "Requests for pronunciation in English entries"
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co-",
        "3": "disjoint"
      },
      "expansion": "co- + disjoint",
      "name": "af"
    }
  ],
  "etymology_text": "From co- + disjoint.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "codisjoint (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "en:Set theory"
      ],
      "glosses": [
        "Of two or more sets, having an union equal to the universal set."
      ],
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "union",
          "union"
        ],
        [
          "universal set",
          "universal set"
        ]
      ],
      "raw_glosses": [
        "(set theory) Of two or more sets, having an union equal to the universal set."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences",
        "set-theory"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "en:Algebra"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              213,
              223
            ]
          ],
          "ref": "2007, Thierry Lucas, “Axioms for Action”, in Logique et Analyse, volume 50, number 200, page 384:",
          "text": "A word of caution however if you want to express the expected connections between these different supports. E.g., it is tempting to prove that S#95;0#123;#61;0#125;#92;alpha and S#95;0#123;#61;1#125;#92;alpha are codisjoint, i.e. that S#95;0#123;#61;0#125;#92;alpha#92;lorS#95;0#123;#61;1#125;#92;alpha#61;1.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Of two or more elements in a lattice, having a join equal to the top element."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "element",
          "element"
        ],
        [
          "lattice",
          "lattice"
        ],
        [
          "join",
          "join"
        ],
        [
          "top",
          "top"
        ]
      ],
      "raw_glosses": [
        "(algebra) Of two or more elements in a lattice, having a join equal to the top element."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "codisjoint"
}

Download raw JSONL data for codisjoint meaning in English (2.0kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2026-07-09 from the enwiktionary dump dated 2026-07-06 using wiktextract (e62056b and e7887d5). 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.