Advertisements
Advertisements
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(~ q ∧ p) ∧ (p ∧ ~ p)
Concept: undefined >> undefined
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(p ∧ ~ q) → (~ p ∧ ~ q)
Concept: undefined >> undefined
Advertisements
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
~ p → (p → ~ q)
Concept: undefined >> undefined
Prove that the following statement pattern is a tautology.
(p ∧ q) → q
Concept: undefined >> undefined
Prove that the following statement pattern is a tautology.
(p → q) ↔ (~ q → ~ p)
Concept: undefined >> undefined
Prove that the following statement pattern is a tautology.
(~p ∧ ~q ) → (p → q)
Concept: undefined >> undefined
Prove that the following statement pattern is a tautology.
(~ p ∨ ~ q) ↔ ~ (p ∧ q)
Concept: undefined >> undefined
Prove that the following statement pattern is a contradiction.
(p ∨ q) ∧ (~p ∧ ~q)
Concept: undefined >> undefined
Prove that the following statement pattern is a contradiction.
(p ∧ q) ∧ ~p
Concept: undefined >> undefined
If p is any statement then (p ∨ ∼p) is a ______.
Concept: undefined >> undefined
Prove that the following statement pattern is a contradiction.
(p ∧ q) ∧ (~p ∨ ~q)
Concept: undefined >> undefined
Prove that the following statement pattern is a contradiction.
(p → q) ∧ (p ∧ ~ q)
Concept: undefined >> undefined
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Concept: undefined >> undefined
Show that the following statement pattern is contingency.
(p∧~q) → (~p∧~q)
Concept: undefined >> undefined
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Concept: undefined >> undefined
Show that the following statement pattern is contingency.
p ∧ [(p → ~ q) → q]
Concept: undefined >> undefined
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Concept: undefined >> undefined
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Concept: undefined >> undefined
Using the truth table, verify
p → (p → q) ≡ ~ q → (p → q)
Concept: undefined >> undefined
Using the truth table, verify
~(p → ~q) ≡ p ∧ ~ (~ q) ≡ p ∧ q.
Concept: undefined >> undefined
