See Boolean algebra in All languages combined, or Wiktionary
Download JSON data for Boolean algebra meaning in English (8.8kB)
{
"derived": [
{
"_dis1": "44 21 36",
"word": "free Boolean algebra"
}
],
"etymology_text": "Named after George Boole (1815–1864), an English mathematician, educator, philosopher and logician.",
"forms": [
{
"form": "Boolean algebras",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Boolean algebra (plural Boolean algebras)",
"name": "en-noun"
}
],
"hypernyms": [
{
"_dis1": "39 25 36",
"sense": "Ockham algebra",
"word": "distributive lattice"
},
{
"_dis1": "44 21 36",
"word": "MV-algebra"
}
],
"hyponyms": [
{
"_dis1": "44 21 36",
"word": "complete Boolean algebra"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"_dis1": "44 21 36",
"word": "Boolean lattice"
},
{
"_dis1": "44 21 36",
"word": "Boolean ring"
}
],
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Algebra",
"orig": "en:Algebra",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "35 25 40",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "35 30 35",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"examples": [
{
"text": "The set of divisors of 30, with binary operators: g.c.d. and l.c.m., unary operator: division into 30, and identity elements: 1 and 30, forms a Boolean algebra."
},
{
"text": "A Boolean algebra is a De Morgan algebra which also satisfies the law of excluded middle and the law of noncontradiction."
}
],
"glosses": [
"An algebraic structure (Σ,∨,∧,∼,0,1) where ∨ and ∧ are idempotent binary operators, ∼ is a unary involutory operator (called \"complement\"), and 0 and 1 are nullary operators (i.e., constants), such that (Σ,∨,0) is a commutative monoid, (Σ,∧,1) is a commutative monoid, ∧ and ∨ distribute with respect to each other, and such that combining two complementary elements through one binary operator yields the identity of the other binary operator. (See Boolean algebra (structure)#Axiomatics.)"
],
"id": "en-Boolean_algebra-en-noun-OMxlQble",
"links": [
[
"algebra",
"algebra"
],
[
"algebraic structure",
"algebraic structure"
],
[
"idempotent",
"idempotent"
],
[
"involutory",
"involutory"
],
[
"monoid",
"monoid"
],
[
"distribute",
"distribute"
]
],
"raw_glosses": [
"(algebra) An algebraic structure (Σ,∨,∧,∼,0,1) where ∨ and ∧ are idempotent binary operators, ∼ is a unary involutory operator (called \"complement\"), and 0 and 1 are nullary operators (i.e., constants), such that (Σ,∨,0) is a commutative monoid, (Σ,∧,1) is a commutative monoid, ∧ and ∨ distribute with respect to each other, and such that combining two complementary elements through one binary operator yields the identity of the other binary operator. (See Boolean algebra (structure)#Axiomatics.)"
],
"topics": [
"algebra",
"mathematics",
"sciences"
],
"translations": [
{
"_dis1": "76 12 12",
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "algebraic structure",
"word": "布爾代數"
},
{
"_dis1": "76 12 12",
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "Bù'ěr dàishù",
"sense": "algebraic structure",
"word": "布尔代数"
},
{
"_dis1": "76 12 12",
"code": "cs",
"lang": "Czech",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Booleova algebra"
},
{
"_dis1": "76 12 12",
"code": "cs",
"lang": "Czech",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "booleovská algebra"
},
{
"_dis1": "76 12 12",
"code": "fr",
"lang": "French",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algèbre de Boole"
},
{
"_dis1": "76 12 12",
"code": "fr",
"lang": "French",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algèbre booléenne"
},
{
"_dis1": "76 12 12",
"code": "de",
"lang": "German",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "boolesche Algebra"
},
{
"_dis1": "76 12 12",
"code": "hu",
"lang": "Hungarian",
"sense": "algebraic structure",
"word": "Boole-algebra"
},
{
"_dis1": "76 12 12",
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebra booleana"
},
{
"_dis1": "76 12 12",
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"masculine"
],
"word": "reticolo booleano"
},
{
"_dis1": "76 12 12",
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebra di Boole"
},
{
"_dis1": "76 12 12",
"code": "ja",
"lang": "Japanese",
"roman": "Būru-daisū",
"sense": "algebraic structure",
"word": "ブール代数"
},
{
"_dis1": "76 12 12",
"code": "ko",
"lang": "Korean",
"roman": "Bul daesu",
"sense": "algebraic structure",
"word": "불 대수"
},
{
"_dis1": "76 12 12",
"code": "ko",
"lang": "Korean",
"roman": "Buul daesu",
"sense": "algebraic structure",
"word": "부울 대수"
},
{
"_dis1": "76 12 12",
"code": "mk",
"lang": "Macedonian",
"roman": "Bulova algébra",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Булова алге́бра"
},
{
"_dis1": "76 12 12",
"code": "ro",
"lang": "Romanian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebră booleană"
},
{
"_dis1": "76 12 12",
"code": "ru",
"lang": "Russian",
"roman": "búleva álgebra",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "бу́лева а́лгебра"
},
{
"_dis1": "76 12 12",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Booleova algebra"
},
{
"_dis1": "76 12 12",
"code": "sv",
"lang": "Swedish",
"sense": "algebraic structure",
"word": "Boolesk algebra"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Algebra",
"orig": "en:Algebra",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computing",
"orig": "en:Computing",
"parents": [
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Logic",
"orig": "en:Logic",
"parents": [
"Formal sciences",
"Philosophy",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "35 25 40",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "35 30 35",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or \"true\" and \"false\") and are subject to operations based on AND, OR and NOT"
],
"id": "en-Boolean_algebra-en-noun-ALQ6SjTq",
"links": [
[
"algebra",
"algebra"
],
[
"logic",
"logic"
],
[
"computing",
"computing#Noun"
],
[
"element",
"element"
],
[
"values",
"values"
],
[
"operation",
"operation"
],
[
"AND",
"AND"
],
[
"OR",
"OR"
],
[
"NOT",
"NOT"
]
],
"raw_glosses": [
"(algebra, logic, computing) Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or \"true\" and \"false\") and are subject to operations based on AND, OR and NOT"
],
"synonyms": [
{
"_dis1": "1 99 0",
"sense": "Specifically ...",
"word": "switching algebra"
}
],
"topics": [
"algebra",
"computing",
"engineering",
"human-sciences",
"logic",
"mathematics",
"natural-sciences",
"philosophy",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "35 25 40",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "33 21 46",
"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+disamb"
},
{
"_dis": "35 30 35",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"The study of such algebras; Boolean logic, classical logic."
],
"hypernyms": [
{
"_dis1": "36 17 47",
"sense": "Heyting algebra",
"word": "residuated lattice"
}
],
"id": "en-Boolean_algebra-en-noun-T~eTsbyR",
"links": [
[
"mathematics",
"mathematics"
],
[
"Boolean logic",
"Boolean logic"
],
[
"classical logic",
"classical logic"
]
],
"raw_glosses": [
"(mathematics) The study of such algebras; Boolean logic, classical logic."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Boolean algebra",
"George Boole"
],
"word": "Boolean algebra"
}
{
"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"
],
"derived": [
{
"word": "free Boolean algebra"
}
],
"etymology_text": "Named after George Boole (1815–1864), an English mathematician, educator, philosopher and logician.",
"forms": [
{
"form": "Boolean algebras",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Boolean algebra (plural Boolean algebras)",
"name": "en-noun"
}
],
"hypernyms": [
{
"sense": "Ockham algebra",
"word": "distributive lattice"
},
{
"sense": "Heyting algebra",
"word": "residuated lattice"
},
{
"word": "MV-algebra"
}
],
"hyponyms": [
{
"word": "complete Boolean algebra"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Boolean lattice"
},
{
"word": "Boolean ring"
}
],
"senses": [
{
"categories": [
"en:Algebra"
],
"examples": [
{
"text": "The set of divisors of 30, with binary operators: g.c.d. and l.c.m., unary operator: division into 30, and identity elements: 1 and 30, forms a Boolean algebra."
},
{
"text": "A Boolean algebra is a De Morgan algebra which also satisfies the law of excluded middle and the law of noncontradiction."
}
],
"glosses": [
"An algebraic structure (Σ,∨,∧,∼,0,1) where ∨ and ∧ are idempotent binary operators, ∼ is a unary involutory operator (called \"complement\"), and 0 and 1 are nullary operators (i.e., constants), such that (Σ,∨,0) is a commutative monoid, (Σ,∧,1) is a commutative monoid, ∧ and ∨ distribute with respect to each other, and such that combining two complementary elements through one binary operator yields the identity of the other binary operator. (See Boolean algebra (structure)#Axiomatics.)"
],
"links": [
[
"algebra",
"algebra"
],
[
"algebraic structure",
"algebraic structure"
],
[
"idempotent",
"idempotent"
],
[
"involutory",
"involutory"
],
[
"monoid",
"monoid"
],
[
"distribute",
"distribute"
]
],
"raw_glosses": [
"(algebra) An algebraic structure (Σ,∨,∧,∼,0,1) where ∨ and ∧ are idempotent binary operators, ∼ is a unary involutory operator (called \"complement\"), and 0 and 1 are nullary operators (i.e., constants), such that (Σ,∨,0) is a commutative monoid, (Σ,∧,1) is a commutative monoid, ∧ and ∨ distribute with respect to each other, and such that combining two complementary elements through one binary operator yields the identity of the other binary operator. (See Boolean algebra (structure)#Axiomatics.)"
],
"topics": [
"algebra",
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Algebra",
"en:Computing",
"en:Logic"
],
"glosses": [
"Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or \"true\" and \"false\") and are subject to operations based on AND, OR and NOT"
],
"links": [
[
"algebra",
"algebra"
],
[
"logic",
"logic"
],
[
"computing",
"computing#Noun"
],
[
"element",
"element"
],
[
"values",
"values"
],
[
"operation",
"operation"
],
[
"AND",
"AND"
],
[
"OR",
"OR"
],
[
"NOT",
"NOT"
]
],
"raw_glosses": [
"(algebra, logic, computing) Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or \"true\" and \"false\") and are subject to operations based on AND, OR and NOT"
],
"topics": [
"algebra",
"computing",
"engineering",
"human-sciences",
"logic",
"mathematics",
"natural-sciences",
"philosophy",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"The study of such algebras; Boolean logic, classical logic."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"Boolean logic",
"Boolean logic"
],
[
"classical logic",
"classical logic"
]
],
"raw_glosses": [
"(mathematics) The study of such algebras; Boolean logic, classical logic."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"synonyms": [
{
"sense": "Specifically ...",
"word": "switching algebra"
}
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "algebraic structure",
"word": "布爾代數"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "Bù'ěr dàishù",
"sense": "algebraic structure",
"word": "布尔代数"
},
{
"code": "cs",
"lang": "Czech",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Booleova algebra"
},
{
"code": "cs",
"lang": "Czech",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "booleovská algebra"
},
{
"code": "fr",
"lang": "French",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algèbre de Boole"
},
{
"code": "fr",
"lang": "French",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algèbre booléenne"
},
{
"code": "de",
"lang": "German",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "boolesche Algebra"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "algebraic structure",
"word": "Boole-algebra"
},
{
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebra booleana"
},
{
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"masculine"
],
"word": "reticolo booleano"
},
{
"code": "it",
"lang": "Italian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebra di Boole"
},
{
"code": "ja",
"lang": "Japanese",
"roman": "Būru-daisū",
"sense": "algebraic structure",
"word": "ブール代数"
},
{
"code": "ko",
"lang": "Korean",
"roman": "Bul daesu",
"sense": "algebraic structure",
"word": "불 대수"
},
{
"code": "ko",
"lang": "Korean",
"roman": "Buul daesu",
"sense": "algebraic structure",
"word": "부울 대수"
},
{
"code": "mk",
"lang": "Macedonian",
"roman": "Bulova algébra",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Булова алге́бра"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "algebră booleană"
},
{
"code": "ru",
"lang": "Russian",
"roman": "búleva álgebra",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "бу́лева а́лгебра"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "algebraic structure",
"tags": [
"feminine"
],
"word": "Booleova algebra"
},
{
"code": "sv",
"lang": "Swedish",
"sense": "algebraic structure",
"word": "Boolesk algebra"
}
],
"wikipedia": [
"Boolean algebra",
"George Boole"
],
"word": "Boolean algebra"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-04-26 from the enwiktionary dump dated 2024-04-21 using wiktextract (93a6c53 and 21a9316). 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.