Truth tables: Difference between revisions

Revision as of 12:02, 1 June 2016

This is an important concept. You should fully understand this.

This is a basic concept in computer science

A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables (Enderton, 2001). In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, logically valid.^[1]

Boolean[edit]

This is one of the better videos I've seen on boolean. Content gratefully used with permission : ^[2]

Truth Tables[edit]

Do you understand this topic?[edit]

Do you have an advanced understanding about this topic?[edit]

[[2.1.11 Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. Level 1
[[2.1.12 Construct truth tables using the above operators. Level 3
[[2.1.13 Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. Level 3

References[edit]

[1] ttps://en.wikipedia.org/wiki/Truth_table

[2] ttp://cs50.tv/2015/fall/#license,psets

[1]

[2]

@@ Line 7: / Line 7: @@
 [[File:binary.png|frame|right|This is a basic concept in computer science]]
-In computer science, the Boolean data type is a data type, having two values (usually denoted true and false), intended to represent the 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 associated with conditional statements, which allow different actions and change control flow depending on whether a programmer-specified Boolean condition evaluates to true or false. It is a special case of a more general logical data type; logic does not always have to be Boolean.<ref>https://en.wikipedia.org/wiki/Boolean_data_type</ref>
+A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables (Enderton, 2001). In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, logically valid.<ref>https://en.wikipedia.org/wiki/Truth_table</ref>
 == Boolean==