"Boolean lattice" meaning in English

{
  "forms": [
    {
      "form": "Boolean lattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Boolean lattice (plural Boolean lattices)",
      "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 entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "A Boolean lattice always has 2ⁿ elements for some cardinal number 'n', and if two Boolean lattices have the same size, then they are isomorphic. A Boolean lattice can be defined \"inductively\" as follows: the base case could be the \"degenerate\" Boolean lattice consisting of just one element. This element is less than or equal to itself, which reflects the first \"law of thought\". Inductive step: given the structure of a 2ⁿ-element Boolean lattice, make an exact and separate duplicate of it, which preserves the order relation isomorphically. Then connect the two lattices as follows: choose one as the \"bottom\" and one as the \"top\", then draw an arrow connecting each element of the \"bottom\" lattice to its corresponding element of the \"top\" lattice. The result is the 2ⁿ⁺¹-element Boolean lattice (unique up to order-isomorphism). The 0 of the bottom lattice becomes the new 0, and the 1 of the top lattice becomes the new 1. Note that the 4-element (Boolean) lattice is a square, the 8-element lattice is a cube, the 16-element lattice is a tesseract, and higher-order lattices are higher-dimensional hypercubes in general, with the 0 and 1 always diagonally opposite, i.e., at the highest possible Hamming/taxicab distance from each other (equal to 'n' for an n-dimensional hypercube) and the edges directed so as to connect the vertex closer to 0 to the vertex further away from 0 (in terms of Hamming/taxicab distance)."
        }
      ],
      "glosses": [
        "The lattice corresponding to a Boolean algebra."
      ],
      "hypernyms": [
        {
          "word": "orthocomplemented lattice"
        },
        {
          "word": "ortholattice"
        }
      ],
      "id": "en-Boolean_lattice-en-noun-ImbsfmxL",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "lattice",
          "lattice"
        ],
        [
          "Boolean algebra",
          "Boolean algebra"
        ]
      ],
      "raw_glosses": [
        "(algebra) The lattice corresponding to a Boolean algebra."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "is",
          "lang": "Icelandic",
          "sense": "The lattice corresponding to a Boolean algebra.",
          "tags": [
            "feminine"
          ],
          "word": "Boole-grind"
        }
      ],
      "wikipedia": [
        "Boolean lattice"
      ]
    }
  ],
  "word": "Boolean lattice"
}

{
  "forms": [
    {
      "form": "Boolean lattices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Boolean lattice (plural Boolean lattices)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "orthocomplemented lattice"
    },
    {
      "word": "ortholattice"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Algebra"
      ],
      "examples": [
        {
          "text": "A Boolean lattice always has 2ⁿ elements for some cardinal number 'n', and if two Boolean lattices have the same size, then they are isomorphic. A Boolean lattice can be defined \"inductively\" as follows: the base case could be the \"degenerate\" Boolean lattice consisting of just one element. This element is less than or equal to itself, which reflects the first \"law of thought\". Inductive step: given the structure of a 2ⁿ-element Boolean lattice, make an exact and separate duplicate of it, which preserves the order relation isomorphically. Then connect the two lattices as follows: choose one as the \"bottom\" and one as the \"top\", then draw an arrow connecting each element of the \"bottom\" lattice to its corresponding element of the \"top\" lattice. The result is the 2ⁿ⁺¹-element Boolean lattice (unique up to order-isomorphism). The 0 of the bottom lattice becomes the new 0, and the 1 of the top lattice becomes the new 1. Note that the 4-element (Boolean) lattice is a square, the 8-element lattice is a cube, the 16-element lattice is a tesseract, and higher-order lattices are higher-dimensional hypercubes in general, with the 0 and 1 always diagonally opposite, i.e., at the highest possible Hamming/taxicab distance from each other (equal to 'n' for an n-dimensional hypercube) and the edges directed so as to connect the vertex closer to 0 to the vertex further away from 0 (in terms of Hamming/taxicab distance)."
        }
      ],
      "glosses": [
        "The lattice corresponding to a Boolean algebra."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "lattice",
          "lattice"
        ],
        [
          "Boolean algebra",
          "Boolean algebra"
        ]
      ],
      "raw_glosses": [
        "(algebra) The lattice corresponding to a Boolean algebra."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Boolean lattice"
      ]
    }
  ],
  "translations": [
    {
      "code": "is",
      "lang": "Icelandic",
      "sense": "The lattice corresponding to a Boolean algebra.",
      "tags": [
        "feminine"
      ],
      "word": "Boole-grind"
    }
  ],
  "word": "Boolean lattice"
}