1. (2 points) Use truth tables to prove logical equivalence. p ? (q ? r) ? (p ? q) ? (p ? r) 2. (2 points) Show that the statement form is a tautology without using truth table (?p ? q) ? (p ? ?q) 3. (2 points) For the circuits corresponding to the Boolean expression there is an equivalent circuit with at most two logic gates. Find such a circuit. (?P ? ?Q) ? (?P ? Q) ? (P ? ?Q)
Added by William L.
Close
Step 1
| p | q | r | q V r | p ^ (q V r) | p ^ q | p V r | (p ^ q) V (p V r) | |---|---|---|-------|------------|-------|-------|-------------------| | T | T | T | T | T | T | T | T | | T | T | F | T | T | T | T Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 85 other Intro Stats / AP Statistics 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
Use truth tables to verify these equivalences. $\begin{array}{ll}{\text { a) } p \wedge \mathbf{T} \equiv p} & {\text { b) } p \vee \mathbf{F} \equiv p} \\ {\text { c) } p \wedge \mathbf{F} \equiv \mathbf{F}} & {\text { d) } p \vee \mathbf{F} \equiv \mathbf{T}} \\ {\text { e) } p \vee p \equiv p} & {\text { f) } p \wedge p \equiv p}\end{array}$
The Foundations: Logic and Proofs
Propositional Equivalences
Use a truth table to prove that
Sri K.
The logical operators NAND (not and) and NOR (not or) are defined as follows: $$\begin{aligned} p \mathrm{NAND} q &=\sim(p \wedge q) \\ p \mathrm{NOR} q &=\sim(p \vee q) \end{aligned}$$ Construct a truth table for each proposition. $$ p \text { NOR } q $$
The Language Of Logic
Logical Equivalences
Recommended Textbooks
Elementary Statistics a Step by Step Approach
The Practice of Statistics for AP
Introductory Statistics
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD