When applying R-diagrams to logic theory,
logical statements p, q, and r can each become a line or multiple lines to visually display the validity of each element in a larger statement. Generally, p is thought to be represented by an upward sloping line (/) while q is represented by a downward sloping line (\). A dot in the diagram above a slanting line indicates truth for that statement; likewise, a dot below indicates falsity. The R-diagrams for p and q are shown below, respectively: For more than two statements, the four spaces formed by the intersection of lines p and q must be subdivided into more lines. In the case of r, a single upward sloping line (/) is added in each of the four spaces. The R-diagram for r is shown below: This method can be extended for any number of truth values: , etc. R-diagrams are primarily used to represent logical expressions. Given a logical proposition, R-diagrams are able to display the outcome of every possible true/false variation of each element, creating an alternative way to represent a
truth table. All the basic logical operations, or
connectives, can be expressed using an R-diagrams as a more easily readable alternative to a truth table, as is shown in the table below:
Simplifying logical expressions R-diagrams can be used to easily simplify complicated logical expressions, using a step-by-step process. Using order of operations, logical operators are applied to R-diagrams in the proper sequence. Finally, the result is an R-diagram that can be converted back into a simpler logical expression. For example, take the following expression: : (Q \leftrightarrow P) \lor (\lnot P \land Q) \, It can be simplified using R-diagrams as follows: : (\leftrightarrow) \lor (\land) \lor which is equal to: : P \rightarrow Q. \,
Proving logical arguments Similarly, R-diagrams can be used to prove or disprove logical arguments. Take, for instance, the well known argument
modus ponens, also known as implication elimination: : \frac{P \to Q, P}{\therefore Q} This can be converted into a
tautological logical expression, : ((P \to Q) \land P) \to Q which can then be simplified using R-diagrams: : (( \to ) \land ) \to ( \land ) \to \to The result is an R-diagram in which every space has a dot. This means the argument is a tautology; it is true in all cases. An R-diagram in which no space has a dot is a
contradiction, a statement that is never true. == Application to set theory ==