0% found this document useful (0 votes)
15 views5 pages

Propositional Logic Exercises and Truth Tables

The document is a tutorial for CSC510 covering propositional logic, including identifying propositions, determining truth values, negations, and expressing logical statements using connectives. It contains exercises on various logical expressions and truth tables. The tutorial is based on content from the book by Rosen, chapter 1.

Uploaded by

thisisacoralreef
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)
15 views5 pages

Propositional Logic Exercises and Truth Tables

The document is a tutorial for CSC510 covering propositional logic, including identifying propositions, determining truth values, negations, and expressing logical statements using connectives. It contains exercises on various logical expressions and truth tables. The tutorial is based on content from the book by Rosen, chapter 1.

Uploaded by

thisisacoralreef
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

CSC510 - Tutorial 1

1.1-1.3 Propositional
(taken from book Rosen, chapter 1)

1. Which of these sentences are propositions? What are the truth values of those
that are propositions?

a) Boston is the capital of Massachusetts.


b) Miami is the capital of Florida.
c) 2 + 3 = 5.
d) 5 + 7 = 10.
e) x + 2 = 11.
f ) Answer this question.

2. Which of these are propositions?What are the truth values of those that are
propositions?

a) Do not pass go.


b) What time is it?
c) There are no black flies in Maine.
d) 4 + x = 5.
e) The moon is made of green cheese.
f ) 2n ≥ 100.

3. What is the negation of each of these propositions?

a) Mei has an MP3 player.


b) There is no pollution in New Jersey.
c) 2 + 1 = 3.
d) The summer in Maine is hot and sunny.

4. What is the negation of each of these propositions?

a) Jennifer and Teja are friends.


b) There are 13 items in a baker’s dozen.
c) Abby sent more than 100 text messages every day.
d) 121 is a perfect square.

5. What is the negation of each of these propositions?

a) Steve has more than 100 GB free disk space on his laptop.
b) Zach blocks e-mails and texts from Jennifer.
c) 7 x 11 x 13 = 999.
d) Diane rode her bicycle 100 miles on Sunday
8. Let p and q be the propositions

p : I bought a lottery ticket this week.


q : I won the million dollar jackpot.
Express each of these propositions as an English sentence.

a) ¬p b) p ∨ q c) p → q
d) p ∧ q e) p ↔ q f ) ¬p →¬q
g) ¬p ∧¬q h) ¬p ∨ (p ∧ q)

9. Let p and q be the propositions “Swimming at the New Jersey shore is


allowed” and “Sharks have been spotted near the shore,” respectively. Express
each of these compound propositions as an English sentence.

b) p ∧ q
a) ¬q

c) ¬p ∨ q
d) p →¬q
e) ¬q → p
f ) ¬p →¬q
g) p ↔¬q
h) ¬p ∧ (p∨ ¬q)

10. Let p and q be the propositions “The election is decided” and “The votes have
been counted,” respectively. Express each of these compound propositions as
an English sentence.

b) p ∨ q
a) ¬p

c) ¬p ∧ q
d) q → p
e) ¬q →¬p
f ) ¬p →¬q

h) ¬q ∨ (¬p ∧ q)
g) p ↔ q

11. Let p and q be the propositions


p : It is below freezing.
q : It is snowing.
Write these propositions using p and q and logical connectives
(including negations).
a) It is below freezing and snowing.
b) It is below freezing but not snowing.
c) It is not below freezing and it is not snowing.
d) It is either snowing or below freezing.
e) If it is below freezing, it is also snowing.
f ) Either it is below freezing or it is snowing, but it is
not snowing if it is below freezing.
g) That it is below freezing is necessary and sufficient
for it to be snowing.

12. Let p, q, and r be the propositions

p :You have the flu.


q :You miss the final examination.
r :You pass the course.
Express each of these propositions as an English sentence.
a) p → q
b) ¬q ↔ r

d) p ∨ q ∨ r
c) q →¬r

e) (p →¬r) ∨ (q →¬r)
f ) (p ∧ q) ∨ (¬q ∧ r)

13. Let p and q be the propositions


p :You drive over 65 miles per hour.
q :You get a speeding ticket.
Write these propositions using p and q and logical connectives
(including negations).

a) You do not drive over 65 miles per hour.


b) You drive over 65 miles per hour, but you do not get a speeding ticket.
c) You will get a speeding ticket if you drive over 65 miles per hour.
d) If you do not drive over 65 miles per hour, then you will not get a speeding
ticket.
e) Driving over 65 miles per hour is sufficient for getting a speeding ticket.
f ) You get a speeding ticket, but you do not drive over 65 miles per hour.
g) Whenever you get a speeding ticket, you are driving over 65 miles per hour.
16. Determine whether these biconditionals are true or false.

a) 2 + 2 = 4 if and only if 1 + 1 = 2.
b) 1 + 1 = 2 if and only if 2 + 3 = 4.
c) 1 + 1 = 3 if and only if monkeys can fly.
d) 0 > 1 if and only if 2 > 1.
17. Determine whether each of these conditional statements is true or false.

a) If 1 + 1 = 2, then 2 + 2 = 5.
b) If 1 + 1 = 3, then 2 + 2 = 4.
c) If 1 + 1 = 3, then 2 + 2 = 5.
d) If monkeys can fly, then 1 + 1 = 3.

18. Determine whether each of these conditional statements is true or false.

a) If 1 + 1 = 3, then unicorns exist.


b) If 1 + 1 = 3, then dogs can fly.
c) If 1 + 1 = 2, then dogs can fly.
d) If 2 + 2 = 4, then 1 + 2 = 3.

a) p ∧¬p
31. Construct a truth table for each of these compound propositions.

b) p ∨¬p
c) (p ∨¬q) → q
d) (p ∨ q) → (p ∧ q)
e) (p → q) ↔ (¬q →¬p)
f ) (p → q) → (q → p)

32. Construct a truth table for each of these compound propositions.


a) p →¬p

c) p ⊕ (p ∨ q)
b) p ↔¬p

d) (p ∧ q) → (p ∨ q)

f ) (p ↔ q) ⊕ (p ↔¬q)
e) (q →¬p) ↔ (p ↔ q)

a) p → (¬q ∨ r)
37. Construct a truth table for each of these compound propositions.

c) (p → q) ∨ (¬p → r)
b) ¬p → (q → r)

d) (p → q) ∧ (¬p → r)
e) (p ↔ q) ∨ (¬q ↔ r)
f ) (¬p ↔¬q) ↔ (q ↔ r)

38. Construct a truth table for ((p → q) → r) → s.


39. Construct a truth table for (p ↔ q) ↔ (r ↔ s).

You might also like