Definition:Conditional/Truth Table
Jump to navigation
Jump to search
Definition
The characteristic truth table of the conditional (implication) operator $p \implies q$ is as follows:
- $\begin {array} {|cc||c|} \hline p & q & p \implies q \\ \hline \F & \F & \T \\ \F & \T & \T \\ \T & \F & \F \\ \T & \T & \T \\ \hline \end {array}$
As $\implies$ is not commutative, it is also instructive to give a characteristic truth tables for $p \impliedby q$ (which of course is the same as $q \implies p$).
Hence the characteristic truth tables of the conditional (implication) operator $p \impliedby q$ and the complements of both $p \implies q$ and $p \impliedby q$ are as follows:
- $\begin {array} {|cc||c||c|c|} \hline p & q & \neg \paren {p \implies q} & p \impliedby q & \neg \paren {p \impliedby q} \\ \hline \F & \F & \F & \T & \F \\ \F & \T & \F & \F & \T \\ \T & \F & \T & \T & \F \\ \T & \T & \F & \T & \F \\ \hline \end {array}$
Matrix Form
- $\begin{array}{c|cc} \implies & \T & \F \\ \hline \T & \T & \F \\ \F & \T & \T \\ \end{array}$
Truth Table Number
The truth table number of the conjunction operator $p \land q$ is as follows:
Ascending order:
- $1101$ or $\T \T \F \T$
Descending order:
- $1011$ or $\T \F \T \T$
Sources
- 1946: Alfred Tarski: Introduction to Logic and to the Methodology of Deductive Sciences (2nd ed.) ... (previous) ... (next): $\S \text{II}.13$: Symbolism of sentential calculus
- 1959: A.H. Basson and D.J. O'Connor: Introduction to Symbolic Logic (3rd ed.) ... (previous) ... (next): $\S 2.4$: Relations between Truth-Functions
- 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): Chapter $1$: Sets, Functions, and Relations: $\S 2$: Some Remarks on the Use of the Connectives and, or, implies
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 1$: Some mathematical language: Connectives
- 1980: D.J. O'Connor and Betty Powell: Elementary Logic ... (previous) ... (next): $\S \text{I}: 3$: Logical Constants $(2)$
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.1$: The need for logic
- 1988: Alan G. Hamilton: Logic for Mathematicians (2nd ed.) ... (previous) ... (next): $\S 1$: Informal statement calculus: $\S 1.2$: Truth functions and truth tables: Conditional
- 1993: M. Ben-Ari: Mathematical Logic for Computer Science ... (previous) ... (next): Chapter $2$: Propositional Calculus: $\S 2.1$: Boolean operators
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability ... (previous) ... (next): $\S 1.1$: Introduction
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): implication: 1. (material implication)
- 2000: Michael R.A. Huth and Mark D. Ryan: Logic in Computer Science: Modelling and reasoning about systems ... (previous) ... (next): $\S 1.4.1$: The meaning of logical connectives: Figure $1.9$
- 2008: David Joyner: Adventures in Group Theory (2nd ed.) ... (previous) ... (next): Chapter $1$: Elementary, my dear Watson: $\S 1.1$: You have a logical mind if...
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): implication: 1. (material implication)
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): $\S 2.2.2$: Example $2.21$
- 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): implication