Scribd
Upload
8 views

Assignment 3

Uploaded by

umar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views

Assignment 3

Uploaded by

umar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Discrete Structure---------Assignment 3

Instructor---- Muhammad Umar Nasir


Due Date: 06-May-2020
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.
2. What is the negation of each of these propositions?
a) Today is Thursday b) There is no pollution in New Jersey.
3. Let p and q be the propositions
p : I bought a lottery ticket this week.
q : I won the million dollar jackpot.

b) p ∨ q
Express each of these propositions as an English sentence.
a) ￢p c) p q
4.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.
5. 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.
6.Determine whether each of these conditional statements is true or false.
a) If 1 + 1 = 3, then unicorns exists. b) If 1 + 1 = 3, then dogs can fly.
7.Construct a truth table for each of these compound propositions.

c) p ⊕ (p ∨ q) d) (p ∧ q) (p ∨ q)
a) p ￢p b) p ↔￢p

b) p ∨ F ≡ p
8.Use truth tables to verify these equivalences.
a) p T ≡ p c) p F ≡F

a) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r).
9.Use truth tables to verify the associative laws

p (q ∨ r) ≡ (p q) ∨ (p r).
10.Use a truth table to verify the distributive law

b) p → (p ∨ q)
11.Show that each of these conditional statements is a tautology by using truth tables.
a) (p q) → p
12.Show that p ↔ q and p ↔ q are logically equivalent.

13. Show that (p ⊕ q) and p ↔ q are logically equivalent

You might also like