Any two propositions P and Q can be conjoined, producing the new, complex, proposition:
P and Q
The proposition P and Q is true if and only if both P and Q are true. It is false otherwise.
Any two propositions P and Q can be disjoined, producing the new, complex, proposition:
P or Q
The proposition P and Q is true if and only if either P or Q are true. It is false only if both P and Q are false.
Any two propositions P and Q can be joined by a conditional operator, producing the new, complex, proposition:
If P then Q
The proposition If P then Q is true if and only if either P is false or Q is true. It is false only when P is true and Q is false.
Any proposition P can be converted into its negation with a negation operator, producing the new, complex, proposition:
Not P
The proposition Not P is true if and only if P is false. It is false only if P is true. The truth table for Not P is as follows:
P if and only if Q
The proposition P if and only if Q is true if and only if both P and Q are true, or if both P and Q are false. It is false only when one of them is true and the other false.
