Category:Boolean algebra
- العربية
- Azərbaycanca
- تۆرکجه
- বাংলা
- 閩南語 / Bân-lâm-gú
- Беларуская
- Беларуская (тарашкевіца)
- Български
- Bosanski
- Català
- Чӑвашла
- Čeština
- Deutsch
- Ελληνικά
- Español
- Esperanto
- فارسی
- Français
- 한국어
- Հայերեն
- हिन्दी
- Italiano
- עברית
- Қазақша
- Kurdî
- Latina
- Latviešu
- Lietuvių
- Lombard
- Македонски
- Nederlands
- 日本語
- Norsk bokmål
- Norsk nynorsk
- Oʻzbekcha / ўзбекча
- Português
- Română
- Русский
- Simple English
- Ślůnski
- Српски / srpski
- Srpskohrvatski / српскохрватски
- Svenska
- ไทย
- Türkçe
- Українська
- 粵語
- 中文
From Wikipedia, the free encyclopedia
Wikimedia Commons has media related to Boolean algebra .
Boolean algebra can refer to:
- A calculus for the manipulation of truth values (T and F).
- A complemented distributive lattice. These can be used to model the operations on truth values.
Boolean algebra is intimately related to propositional logic (sentential logic) as well.
The main article for this category is Boolean algebra .
See also
[edit ]Subcategories
This category has the following 2 subcategories, out of 2 total.
L
- Logical connectives (21 P)
N
- Normal forms (logic) (13 P)
Pages in category "Boolean algebra"
The following 101 pages are in this category, out of 101 total. This list may not reflect recent changes.
B
- Balanced Boolean function
- Bent function
- Binary decision diagram
- Bitwise operation
- George Boole
- Boole's expansion theorem
- Boolean algebras canonically defined
- Boolean conjunctive query
- Boolean data type
- Boolean differential calculus
- Boolean domain
- Boolean expression
- Boolean function
- Boolean matrix
- Boolean prime ideal theorem
- Boolean ring
- Boolean satisfiability algorithm heuristics
- Boolean satisfiability problem
- Boolean-valued
- Boolean-valued function
- Boolean-valued model
- Booleo