Discrete Mathematics Quiz

p → q is logically equivalent to

• ¬p ∨ ¬q

• p ∨ ¬q

• ¬ p ∨ q

• ¬ p ∧ q

The compound proposition p logically imply the compound proposition q (i.e.,p⇒q) if ________ is a tautology

• p ↔ q

• p → q

• q → p

• q ↔ p

p ∨ ¬ p) ∨ (q ∨ T) is a

• Tautology

• Contradiction

• Contingency

• Neither a tautology nor a contradiction

Q→P is the ------------- of P→Q

• Converse

• Inverse

• contrapositive

• Biconditional

p ∨ q is logically equivalent to

• ¬q → ¬p

• q → p

• ¬p → ¬q

• ¬p → q

The proposition P∨(Q∧R) is logically equivalent to

• (P∨Q)∧(P∨R)

• (P∧Q)∨(P∧R)

• (P∧Q)∧(P∨R)

• (P∨Q)∧(P∧R)

The law ¬(P∧Q)≡¬P∨¬Q is known as

• Absorption law

• Distributive law

• Commutative Law

• De Morgan Law

P → (Q → R) is equivalent to

• (P ∧ Q) → R

• (P ∨ Q) → R

• (P ∨ Q) → ˥R

• R ∧ (P ∨ Q)

The implication ¬P,P∨Q⇒Q is known as

• Disjunctive Syllogism

• Modus Ponens

• Modus Tollens

• Hypothetical Syllogism

The law P∨(Q∧R) ≡(P∨Q) ∧ (P ∨ R) is known as

• Commutative Law

• Distributive law

• Absorption law

• Associative Law