"free Boolean algebra" meaning in English

{
  "forms": [
    {
      "form": "free Boolean algebras",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "free Boolean algebra"
      },
      "expansion": "free Boolean algebra (plural free Boolean algebras)",
      "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": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are \"true\" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms."
      ],
      "id": "en-free_Boolean_algebra-en-noun-2HOC-3w~",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "field of sets",
          "field of sets"
        ],
        [
          "equivalence classe",
          "equivalence classe"
        ],
        [
          "power set",
          "power set"
        ],
        [
          "valuation",
          "valuation"
        ],
        [
          "conjunction",
          "conjunction"
        ],
        [
          "linear combination",
          "linear combination"
        ],
        [
          "disjunction",
          "disjunction"
        ]
      ],
      "raw_glosses": [
        "(algebra) A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are \"true\" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "free Boolean algebra"
      ]
    }
  ],
  "word": "free Boolean algebra"
}

{
  "forms": [
    {
      "form": "free Boolean algebras",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "free Boolean algebra"
      },
      "expansion": "free Boolean algebra (plural free Boolean algebras)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Algebra"
      ],
      "glosses": [
        "A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are \"true\" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "field of sets",
          "field of sets"
        ],
        [
          "equivalence classe",
          "equivalence classe"
        ],
        [
          "power set",
          "power set"
        ],
        [
          "valuation",
          "valuation"
        ],
        [
          "conjunction",
          "conjunction"
        ],
        [
          "linear combination",
          "linear combination"
        ],
        [
          "disjunction",
          "disjunction"
        ]
      ],
      "raw_glosses": [
        "(algebra) A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are \"true\" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "free Boolean algebra"
      ]
    }
  ],
  "word": "free Boolean algebra"
}