Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
146 views2 pages

P, Q, R Q P, Q, R: Questions Mark S Co Po

This document contains an assignment with multiple problems in propositional calculus. The problems cover topics such as expressing statements in symbolic form, verifying if statements are tautologies, writing statements using logical connectives, negating statements, showing logical equivalence, finding principal normal forms, determining if conclusions follow from premises, and identifying tautologies. Students are asked to solve the problems and show their work. The problems are marked according to different criteria and mapped to specified course and program outcomes.

Uploaded by

PGSELLING Ezy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
146 views2 pages

P, Q, R Q P, Q, R: Questions Mark S Co Po

This document contains an assignment with multiple problems in propositional calculus. The problems cover topics such as expressing statements in symbolic form, verifying if statements are tautologies, writing statements using logical connectives, negating statements, showing logical equivalence, finding principal normal forms, determining if conclusions follow from premises, and identifying tautologies. Students are asked to solve the problems and show their work. The problems are marked according to different criteria and mapped to specified course and program outcomes.

Uploaded by

PGSELLING Ezy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSIGNMENT PROBLEMS IN UNIT I [Propositional Calculus]

Questions Mark CO PO
s
(a) Express the statement “Good food is not cheap” in symbolic form. (2
Marks)

(b) Verify whether the statement ( P ∨ Q ) → P is a tautology. (4


Marks) 1,
2
(c) LetP , Q , R be the following statements 10 1
&
P : I will study discrete mathematics, Q : I will watch TV, R : I am in a good mood, 12
Write the following statements in terms of P , Q , R and logical connectives
(i). If I do not study discrete mathematics and I watch TV then I am in a good mood.
(ii). If I am in a good mood then I will study discrete mathematics or I will watch TV.
(4 Marks)
(a) Negate the statement “John is playing football” in two different forms. (2
Marks)
1,
(b) Show that the propositions p → q and ¬ p ∨ q are logically equivalent. (4
2
Marks) 10 1
&
12
(c) Show that the formula is a tautology. (4
Marks)

(a) When a set of formulae is consistent and inconsistent? (2


Marks)
(b) Let P , Q , R be the following statements
P : I will study discrete mathematics, Q : I will watch TV, R : I am in a good mood,

Write the following statements in terms of P , Q , R and logical connectives 1,


2
(i). If I am not in a good mood, then I will not watch TV or I will study discrete 10 1
&
mathematics.
(ii). I will watch TV and I will not study discrete mathematics if and only if I am in a 12
good mood.
(4 Marks)

(c) Without truth table find PCNF and PDNF of P → ( Q ∧ R ) ∧ ( ¬ P → (¬ Q ∧ ¬ R ) ) .


(4 Marks)

(a) Express the bi-conditional P ↔ Q in any form using only disjunction ( ¿ ) , conjunction 10 1 1,
2
(¿ )
and negation . (2 &
Marks) 12

(b) Determine whether the conclusion C follows logically from the premises
H 1 , H 2 or
not H 1 : P → Q , H 2 : P , C : Q . (4
Marks)

(c) Obtain the principal disjunctive normal form and principal conjunctive normal form of
the statement P ∨ ( ¬ P → ( Q ∨ (¬ Q → R ) ) ) . (4
Marks)

(a) State any two rules of inference with explanation. (2 Marks)

(b) Find PCNF of ( P ∧ Q ) ∨ ( ¬ P ∧ R ) by (i) using truth table (ii) without using truth 1,
table. 2
(4 Marks) 10 1
&
(c) What is meant by tautology? Without using truth table, show that 12
( P ∨ Q ) ∧ ( ¬ P ∧ ( ¬ Q ∨ ¬ R ) ) ∨ ( ¬ P ∧ ¬ Q ) ∨ ( ¬ P ∧ ¬ R ) is a tautology.
(4
Marks)

You might also like