Use a truth table to determine whether the statement is a tautology, a self-contradiction, or neither: (~p ? q) ? (p ? ~q)
Added by Brandon F.
Close
Step 1
Now, let's create a truth table: | p | q | ~p | ~q | ~p v q | p ^ ~q | (~p v q) < (p ^ ~q) | |---|---|----|----|--------|--------|---------------------| | T | T | F | F | T | F | F | | T | F | F | T | F | T | T Show more…
Show all steps
Your feedback will help us improve your experience
Tassha Calista and 100 other Algebra 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
Determine whether the following argument [p → (q ∧ r )] ↔ [(p →q) ∧ (p →r )] is a tautology, a contradiction or neither by constructing a truth table:
Steven C.
Use a truth table to determine whether the given statement Is a self-contradiction. ~r^r Yes No
Joseph R.
Construct a truth table for each statement. Identify any tautologies or contradictions. $$(p \vee \sim p) \rightarrow(p \wedge \sim p)$$
Logic
The Conditional and Circuits
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD