Which one of the following expression is the correct form of Demorgan theorem?
A. [(p ≡ q)] ≡ [(p > q) . (q > p)] and [(p ≡ q)] ≡ [(p.q) ∨ (∼ p. ∼p)]
B. [∼ (p.q)] ≡ [(∼ p∨ ∼ q)] and [∼ (p ∨ q)] ≡ [(∼ p. ∼q)]
C. [p ≡ (p.p)] and [p ≡ (p ∨ p)]
D. [(p.q) ≡ (q.p)] and [(p ∨ q) ≡ (q ∨ p)]
Answer: Option B
This Question Belongs to Philosophy >> Modern Symbolic Logic
Related Questions on Modern Symbolic logic
What is the other name of Propositional Logic?
A. Synthetic Logic
B. Statement Logic
C. Analytical Logic
D. Ethical Logic
Sentential connective is used in which?
A. The value of formulas
B. The construction of formulas
C. The term of formulas
D. The concept of formulas
A. 1, 2 and 3
B. 2, 3 and 4
C. 1, 3 and 4
D. All of these
A consistent theory is essential for which logic?
A. Classical inductive logic
B. Classical deductive logic
C. Classical ethics
D. Western ethics
Join The Discussion