Which of the following formula is in CNF? $a \rightarrow \neg b$ $(a \land b) \lor (\neg \neg c)$ $(a) \land (\neg b \lor c)$ $\neg a \equiv b$
Added by Charles C.
Close
Step 1
A literal is either a variable or the negation of a variable. Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 81 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
Use the Tseitin encoding to convert the following formulas into 3CNF (CNF in which every clause has at most three literals): (a) (A ↔ (A ∧ B)) → (A → B) (b) (A ⊕ B) → (A ∨ B) (c) ((A ∧ B) → C) → (A → C) (d) ((A ∨ B) ∧ (¬A ∨ C)) → (B ∨ C)
Adi S.
For each of these compound propositions, use the conditional-disjunction equivalence (Example 3$)$ to find an equivalent compound proposition that does not involve conditionals. a) $\neg p \rightarrow \neg q$ b) $(p \vee q) \rightarrow \neg p$ c) $(p \rightarrow \neg q) \rightarrow(\neg p \rightarrow q)$
The Foundations: Logic and Proofs
Propositional Equivalences
Which of the following is a tautology? (a) $(\sim p) \wedge(p \vee q) \rightarrow q$ (b) $(\mathrm{q} \rightarrow \mathrm{p}) \vee \sim(\mathrm{p} \rightarrow \mathrm{q})$ (c) $(\sim q) \vee(p \wedge q) \rightarrow q$ (d) $(\mathrm{p} \rightarrow \mathrm{q}) \wedge(\mathrm{q} \rightarrow \mathrm{p})$
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