Scribd
Upload
31 views2 pages

Tutorial 1 1

This document is a tutorial on logic forms and logical equivalence, including exercises on constructing truth tables, writing symbolic forms, and determining logical equivalences. It covers De Morgan's laws and their application to negations, as well as verification of logical equivalences using specific theorems. The tutorial provides a structured approach to understanding logical expressions and their relationships.

Uploaded by

thandananimondli363
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views2 pages

Tutorial 1 1

This document is a tutorial on logic forms and logical equivalence, including exercises on constructing truth tables, writing symbolic forms, and determining logical equivalences. It covers De Morgan's laws and their application to negations, as well as verification of logical equivalences using specific theorems. The tutorial provides a structured approach to understanding logical expressions and their relationships.

Uploaded by

thandananimondli363
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tutorial 1: (Logic Form and Logical Equivalence)

1. Construct truth tables for the following logical expressions:


a) (𝑝 ∧ 𝑞) ∧ 𝑟
b) 𝑝 ∧ (𝑞 ∨ 𝑟)
c) (∼ 𝑝 ∧∼ 𝑞) ∧ (𝑟 ∧∼ 𝑞)

2. Write the following in symbolic form using logical connectives (∼, ⋁, ⋁)


and indicated letters.
a) Let 𝑠 = “stocks are increasing” and 𝑖 =”interest rates are steady.”
i. Stocks are increasing but interest rates are steady.
ii. Neither are stocks increasing nor are interest rates steady.

b) Let 𝑝 =”DATAENDFLAG is off”, 𝑞 =”ERROR equals 0” and 𝑟 = “The


sum is less than 1000”. Write the following statements using
symbols:
i. DATAENDFLAG is off but ERROR is not equal to 0.
ii. DATAFLAG is on and ERROR equals to 0 but SUM is greater
than or equal 1000.

3. Are the following statement forms logically equivalent?


a) 𝑃 ∨ (𝑝 ∧ 𝑞) and 𝑝
b) (𝑝 ∧ 𝑞) ∧ 𝑟 and 𝑝 ∧ (𝑞 ∧ 𝑟)
c) (𝑝 ∨ 𝑞) ∨ 𝑟 and 𝑝 ∧ (𝑞 ∨ 𝑟)

4. Use De Morgan’s laws to write negations of the following statements:


a) The train is late or my watch is fast.
b) The units digits of 467 is 4 or it is 6.
5. Assume 𝑥 is a particular real number and Use De Morgan’s laws to write
negations for the statements:
a) 𝑥 < 2 or 𝑥 > 5
b) 𝑥 ≤ −1 or 𝑥 > 1
c) −10 < 𝑥 < 2

6. Determine whether the statement in (a) is logically equivalent to the


statement in (b):
a) Bob is both a Math and Computer science major and Ann is a Math
major, but Ann is not both a Math and Computer science major.
b) It is not the case that both Bob and Ann are both Math and Computer
science majors, but it is the case that Ann is a Math major and Bob is
both a Math and Computer science major.

7. Is (𝑝⨁𝑞) ∧ 𝑟 ≡ (𝑝 ∧ 𝑟) ⨁(𝑞 ⋀ 𝑟)? Justify your answer.

8. Use theorem 2.1.1 to verify the logical equivalences below:


a) (𝑝 ∧∼ 𝑞) ∨ 𝑝 ≡ 𝑝
b) ∼ (𝑝 ∨∼ 𝑞) ∨ (∼ 𝑝 ∧∼ 𝑞) ≡∼ 𝑝
c) ∼ ((∼ 𝑝 ∧ 𝑞) ∨ (∼ 𝑝 ∧∼ 𝑞)) ∨ (𝑝 ∧ 𝑞) ≡ 𝑝

You might also like