Truth Table

Truth Table is a table that shows the truth value (true or false) of a #202204281244. It takes \(2^n\) steps to display all truth values, where \(n\) is the number of variables involved.

Negation

The \(\sim p\) or \(\neg p\) truth value is shown as below:

\(p\)\(\sim p\)
TF
FT

Conjunction

The \(p \land q\) truth value is shown as below:

\(p\)\(q\)\(p \land q\)
TTT
TFF
FTF
FFF

Inclusive Disjunction

The \(p \lor q\) truth value is shown as below:

\(p\)\(q\)\(p \lor q\)
TTT
TFT
FTT
FFF

Exclusive Disjunction

The \(p \oplus q\) truth value is shown as below:

\(p\)\(q\)\(p \oplus q\)
TTT
TFT
FTT
FFF

Conditional Statement

The \(p \rightarrow q\) truth value is shown as below:

\(p\)\(q\)\(p \rightarrow q\)
TTT
TFF
FTT
FFT

Biconditional Statement

The \(p \leftrightarrow q\) truth value is shown as below:

\(p\)\(q\)\(p \leftrightarrow q\)
TTT
TFF
FTF
FFT
Links to this page
  • Predicate

    If \(P(x)\) is a predicate and \(x\) has domain \(D\), then the truth set of \(P(x)\), denoted \(\{ x \in D | P(x) \}\), is the set of all elements of \(D\) that make \(P(x)\) true when they are substituted for \(x\).

  • Modus Ponens

    It can be proved to be valid by examining its #critical row using 202205061151.

  • Logical Equivalence

    Two #202204281244 are logical equivalence when they share the same truth values# for all situation. For example: \(p\) and \(\sim (\sim p)\) are logical equivalence. The following is their truth table:

  • Logic
  • Implicit Quantification

    \(P(x)\) can be said to implicitly quantify the 202207121344# \(Q(x)\), denoted as \(P(x) \Rightarrow Q(x)\) or \(\forall x, P(x) \rightarrow Q(x)\), if every element in the truth set# of \(P(x)\) is in the truth set of \(Q(x)\).

  • Digital Logic Circuit

    Digital Logic Circuit will output an input/output table that resembles the 202205061151#, which instead of using \(T\) and \(F\), it uses 1 and 0.

  • Contradiction Rule

    It can be proved by the following Truth Table# :

  • Conditional Statement

    For example: If primate is mammal, then human is mammal. This can be denoted using logical operator#, \(p \rightarrow q\). \(p\) is called a hypothesis or antecedent whereas \(q\) is called the conclusion or consequent. The hypothesis of the statement could be false, however it doesn’t imply that the statement is false. On the contrary, the conclusion could still be true, which we call it as vacuously true or true by default. This could be seen from its 202205061151#. If the hypothesis is true, then the conclusion must be true, otherwise it is a false statement.

  • Compound Statement

    Their relationship could be expressed in 202205061151#.

  • Argument
    Construct a 202205061151# showing all the truth values of them.
#logic