布尔逻辑（英語： Boolean algebra ）得名于乔治·布尔，他是爱尔兰 科克的皇后学院的英国数学家，他在十九世纪中叶首次定义了逻辑的代数系统。现在，布尔逻辑在电子学、计算机硬件和软件中有很多应用。

In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra …

布林運算（英語： Boolean algebra ）得名於喬治·布爾，他是愛爾蘭 科克的皇后學院的英國數學家，他在十九世紀中葉首次定義了邏輯的代數系統。現在，布林運算在電子學、電腦硬體和軟體中有很多應用。

In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {-1,1}). [1] [2] Alternative names are switching function, used especially in older computer science literature, [3] [4] and truth function (or logical function), used in logic.

Any kind of logic, function, expression, or theory based on the work of George Boole is considered Boolean. Related to this, "Boolean" may refer to: Boolean data type , a form of data with only two possible values (usually "true" and "false")

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations.

In computer science, a Boolean expression (also known as logical expression) is an expression used in programming languages that produces a Boolean value when evaluated. A Boolean value is either true or false.

In mathematics, Boolean algebra is an algebra for binary digits (where 0 means false and 1 means true). [1] It is equipped with three operators: conjunction (AND), disjunction (OR) and negation (NOT). [2] It uses normal math symbols, but it does not work in the same way. It is named for George Boole, [3] who invented it in the middle 19th century.

George Boole. In computer science, the Boolean (sometimes shortened to Bool) is a data type that has one of two possible values (usually denoted true and false) which is intended to represent the two truth values of logic and Boolean algebra.It is named after George Boole, who first defined an algebraic system of logic in the mid 19th century.The Boolean data type is primarily …

In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length.