190 likes | 454 Views
Contradiction. A statement is a contradiction iff it cannot be T. Contradiction. A statement is a contradiction iff it cannot be T . So its truth table has all F s on the output column. Contradiction. A statement is a contradiction iff it cannot be T .
E N D
Contradiction A statement is a contradiction iff it cannot be T.
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column.
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. Sample: A Standard Contradiction: P&-P
Contradiction P P & -P TF F FF T * A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. Sample: A Standard Contradiction: P&-P
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. Sample: A Standard Contradiction: P&-P Standard Contradictions are not the only ones. -(P>P) -(Pv-P) P<>-P
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. -(P>P) -(Pv-P) P<>-P Contradictions are Bad News: They must be false.
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. -(P>P) -(Pv-P) P<>-P Contradictions are Bad News: They must be false. They carry no information.
Contradiction A statement is a contradiction iff it cannot be T. So its truth table has all Fs on the output column. -(P>P) -(Pv-P) P<>-P Contradictions are Bad News: They must be false. They carry no information. Lousy Weather Report: it is raining and not raining.
Contradiction A -A TF TF TF TF -A is a contradiction iff A is a logical truth.
Contradiction A -A TF TF TF TF -A is a contradiction iff A is a logical truth. So these must be contradictions: -(P>P) -(Pv-P) P<>-P
Contradiction P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs.
Contradiction P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. Here is a proof that -P&P is a contradiction. -(-P&P) GOAL
Contradiction 1) -P&P PA ?&-? -(-P&P) 1-? -I P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. Here is a proof that -P&P is a contradiction.
Contradiction 1) -P&P PA 2) P 1 &O 3) -P 1 &O 4) P&-P 2,3 &I 5) -(-P&P) 1-4 -I P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. Here is a proof that -P&P is a contradiction.
Contradiction P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. with a tree: The tree for A closes.
Contradiction P -(P>P) TFT FFT * P -(P v -P) TF T F FF T T * To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. with a tree: The tree for A closes. Here is a tree that shows that -P&P is a contradiction. -P&P -P P *
Contradiction To show a statement A is a contradiction ... with a table: The output row for A has all Fs. with a proof: Prove -A. with a tree: The tree for A closes. For more click here