Suppose I first assume “P AND q AND r” and derive a contradiction. Then I start over, assume “P AND NOT q AND NOT r”, and derive another contradiction. Then P itself must be a contradiction, and thus “NOT p” is a tautology.
Added by Timothy C.
Step 1
** Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 93 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
In general, suppose you are asked to prove P → Q using proof by contradiction. We assume that P → Q is false. So, what do we assume to start the proof? When this leads to contradiction, why does this prove P → Q?
Sri K.
Use resolution to show that the compound proposition $(p \vee q) \wedge(\neg p \vee q) \wedge(p \vee \neg q) \wedge(\neg p \vee \neg q)$ is not satisfiable.
The Foundations: Logic and Proofs
Rules of Inference
Consider the following two definitions: composite statement X is a tautology if X is always true regardless of the truth values of its variables. composite statement Y is a contradiction if Y is always false regardless of the truth values of its variables. Let P and Q be statements. (a) Prove that P v ~P is a tautology. (b) Prove that P ^ ~P is a contradiction.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD