Scribd
Upload
86 views2 pages

TR1313 Tutorial 1

This document contains a tutorial with multiple choice and true/false questions about propositional logic, including the truth values of various propositions given certain conditions. It also includes exercises to formulate arguments symbolically and determine validity, as well as questions involving quantifiers, induction proofs, and divisibility.

Uploaded by

Kim Say Liang
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
86 views2 pages

TR1313 Tutorial 1

This document contains a tutorial with multiple choice and true/false questions about propositional logic, including the truth values of various propositions given certain conditions. It also includes exercises to formulate arguments symbolically and determine validity, as well as questions involving quantifiers, induction proofs, and divisibility.

Uploaded by

Kim Say Liang
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

TR1313

TUTORIAL 1
Page
no.
30

Question no .
Assuming that p and r value are false and that q and s are true, find the truth value of
each proposition.
13. p q
14. p q
15. (p q)
16. ( p q ) ^ ( q r )
17. (p q ) r
18. p (q r )
19. ( s ( p^ r) ) ^ ( ( p ( r
20. (( p ^ q ) (q ^ r )) ( s

q))^s)
q)

Determine the truth value of each proposition.


31. If 3 + 5 < 2, then 1 + 3 = 4
32. If 3 + 5 < 2, then 1 + 3 4
33. If 3 + 5 > 2, then 1 + 3 = 4
34. If 3 + 5 > 2, then 1 + 3 4
35. 3 + 5 > 2 if and only if 1 + 3 = 4
36. 3 + 5 < 2 if and only if 1 + 3 = 4
37. 3 + 5 < 2 if and only if 1 + 3 4
38. If the earth has six moons, then 1 < 3.
39. If 1 < 3, then the earth has six moons.
31

For each pair of propositions P and Q, state whether or not P Q.


60. P = p, Q = p

61. P = p ^ q, Q = p

62. P = p q, Q = p
63. P = p ^ ( q

r), Q = p

(q ^ r)

64. P = p ^ (q r), Q = (p q) ^ (p r)
65. P = p q, Q = q p
66. P = p q, Q = p q
67. P = (p q) ^ (q r), Q = p r
68. P = (p q) r, Q = p (q r)
69. P = (s (p ^ r)) ^ (( p (r
35

q)) ^s), Q=p s

Formulate the arguments of Exercises 1-5 symbolically and determine whether each is
valid. Let
p: I study hard.
q: I get As.
r: I get rich.
1. If I study hard, then I get As.

I study hard.

I get As.

2. If I study hard, then I get As.


If I dont get rich, then I dont get As.

I get rich.

3. I study hard if and only if I get rich.


I get rich.

I study hard

4. If I study hard or I get rich, then I get As.


I get As.

If I dont study hard, then I get rich.

5. If I study hard, then I get As or I get rich.


I dont get As and I dont get rich.

50

87

102
103

I dont study hard.

Let P(x) be the propositional function x x. Tell whether each proposition in Exercises
12 20 is true or false. The domain of discourse is R.
12. P(1)
13. P(2)
14.P(1/2)
15. x P(x)
16. x P(x)
17. ( x P(x))
18. (x P(x))
19. x P(x)
20. xP(x)
42. Prove for all n

Z, n is odd if and only if n + 2 is odd.

Using induction, verify that each question is true for every positive integer n.
2. 12+23+34+...+n(n+1)= n(n+1)(n+2)
3
Use induction to prove statement.
22. 11 - 6 is divisible by 5, for all n 1.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy