Truth tables for logical expressions

Statements in the propositional logic can only be true or false. Several statements can be combined with logical connections to new statements.
To show the truth content of such a connection of several statements, one can use a truth table,
which compiles all possible combinations of true / false statements and evaluates the truth content of the logical expression.

Such a truth table is created here. The logical connections are implemented with operators of the syntax of C, Java, and JavaScript.
In the table, logical variables are used instead of concrete statements.
The logical variables used in the expressions can be named as desired.

Allowed operators are (operator priority decreasing in this order):
! "not"(negation)
== "exactly, when"(equivalence)
&& "and"(conjunction)
|| "or"(disjunction)
In addition, braces can be used.
Note: The operator priority used here corresponds to the above mentioned programming languages.
In the propositional logic equivalence is weaker than disjunction.

If several expressions are to be displayed in a table, they must be separated by semicolons.

Example of a logical expression with 4 variables: !a || b && !(c && !d)




more JavaScript programs