"minterm" meaning in All languages combined

{
  "forms": [
    {
      "form": "minterms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "minterm (plural minterms)",
      "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "A Boolean function can be expressed, canonically, as a sum of minterms, where each minterm corresponds to a row (of the function's truth table) whose output value is 1.",
          "type": "example"
        },
        {
          "ref": "2014 February 17, Linda Null, Julia Lobur, Essentials of Computer Organization and Architecture, Jones & Bartlett Publishers, →ISBN, page 199:",
          "text": "If a product term includes all of the variables exactly once, either complemented or not complemented, this product term is called a minterm.",
          "type": "quote"
        }
      ],
      "glosses": [
        "In Boolean algebra, a product term, with a value of 1, in which each variable appears once (in either its complemented or uncomplemented form, so that the value of the product term becomes 1)."
      ],
      "holonyms": [
        {
          "word": "canonical disjunctive normal form"
        }
      ],
      "id": "en-minterm-en-noun-LxwSsLOH",
      "links": [
        [
          "Boolean algebra",
          "Boolean algebra"
        ],
        [
          "product term",
          "product term"
        ],
        [
          "variable",
          "variable"
        ],
        [
          "complemented",
          "complemented"
        ],
        [
          "uncomplemented",
          "uncomplemented"
        ]
      ],
      "related": [
        {
          "word": "maxterm"
        }
      ]
    }
  ],
  "word": "minterm"
}

{
  "forms": [
    {
      "form": "minterms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "minterm (plural minterms)",
      "name": "en-noun"
    }
  ],
  "holonyms": [
    {
      "word": "canonical disjunctive normal form"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "maxterm"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "English terms with usage examples",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Logic"
      ],
      "examples": [
        {
          "text": "A Boolean function can be expressed, canonically, as a sum of minterms, where each minterm corresponds to a row (of the function's truth table) whose output value is 1.",
          "type": "example"
        },
        {
          "ref": "2014 February 17, Linda Null, Julia Lobur, Essentials of Computer Organization and Architecture, Jones & Bartlett Publishers, →ISBN, page 199:",
          "text": "If a product term includes all of the variables exactly once, either complemented or not complemented, this product term is called a minterm.",
          "type": "quote"
        }
      ],
      "glosses": [
        "In Boolean algebra, a product term, with a value of 1, in which each variable appears once (in either its complemented or uncomplemented form, so that the value of the product term becomes 1)."
      ],
      "links": [
        [
          "Boolean algebra",
          "Boolean algebra"
        ],
        [
          "product term",
          "product term"
        ],
        [
          "variable",
          "variable"
        ],
        [
          "complemented",
          "complemented"
        ],
        [
          "uncomplemented",
          "uncomplemented"
        ]
      ]
    }
  ],
  "word": "minterm"
}