Scribd
Upload
82 views3 pages

T5 - Propositional Logic

This document discusses propositional logic and provides examples of evaluating propositions and constructing truth tables. It asks questions about determining the truth values of propositions, writing negations of propositions, expressing compound propositions symbolically and as English sentences, evaluating conditional statements, constructing truth tables for compound propositions, and showing logical equivalences using truth tables. Additional questions are asked about constructing additional truth tables, writing negations using De Morgan's laws, and expressing statements symbolically. The answers provided include the truth values, symbolic representations, and completed truth tables for the examples and questions.

Uploaded by

Alinaaa's Channel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
82 views3 pages

T5 - Propositional Logic

This document discusses propositional logic and provides examples of evaluating propositions and constructing truth tables. It asks questions about determining the truth values of propositions, writing negations of propositions, expressing compound propositions symbolically and as English sentences, evaluating conditional statements, constructing truth tables for compound propositions, and showing logical equivalences using truth tables. Additional questions are asked about constructing additional truth tables, writing negations using De Morgan's laws, and expressing statements symbolically. The answers provided include the truth values, symbolic representations, and completed truth tables for the examples and questions.

Uploaded by

Alinaaa's Channel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Discrete Mathematics AAQS007-4-1 Propositional Logic

1. Which of these sentences are propositions? What are the truth values of those that are
propositions?
(a) Cat is an insect.
(b) 2 + 3 = 5
(c) 5 + 7=10
(d) x + 2 = 11
(e) Answer this question.
(f) What time is it?

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


(a) It is raining
(b) 1 + 1 = 2
(c) Lion can not fly
(d) 1 + 2 = 3 or 2 + 1 = 3

3. 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
(a) It is freezing and snowing.
(b) It is below freezing but no snowing.
(c) It is not below freezing and it is not snowing.
(d) It is either snowing or below freezing (but not both).
(e) It is below freezing or snowing, but it is not snowing if it is below freezing.
(f) It is below freezing if and only if it is snowing.

4. 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.
(a) ~ q
(b) p  q
(c) ~ p  q
(d) ~ q  p
(e) p  ~ q

5. 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.

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


(a) ~p  q
(b) (p  q)  ~r
(c) (p  q)  r
(d) ~(p  ~q)  ~r
(e) (p  ~r)  (q  r)

7. Using same truth table, show that

Diploma Asia Pacific University of Technology & Innovation Page 1 of 3


Discrete Mathematics AAQS007-4-1 Propositional Logic

(a) ~(p  q)  p  q
(b) (p  q)  (p  r)  p  (q  r)
(c) ~p  (q  r)  q  (p  r)
(d) (p  q)  (~p  r)  (q  r) is a tautology
(e) (p  q)  (q  r)  (p  r) is a tautology

Answers:

1. (a) Proposition, F (b) Proposition, T (c) Proposition, F


(d) Not a proposition (e) Not a proposition (f) Not a proposition
2. (a) It is not raining. (b) 1 + 1 ≠ 2 (c) Lion can fly.
(d) 1 + 2 ≠ 3 and 2 + 1 ≠ 3
5. (a) F (b) T (c) T (d) T
6. (a) TFTT (b) FTTTTTTT (c) FTTFTFFT
(d) FTTTFTFT (e) FFFTTFTT

Additional Questions:

1. Construct a truth table for the compound proposition below.


~  p  q    q ~ r 

2. (a) Write a negation for the statement below.


(i) Today is Wednesday and it is a holiday.
(ii) x < 2 or x > 5
(b) State the law used in both part (i) and (ii).

3. Consider the propositions of


p: Andy is tall, q: Andy is dark haired.
Write the sentences below in symbolic form.
(a) Andy is tall or dark haired.
(b) Andy is dark haired but short.
(c) It is not true that Andy is short and fair haired.

4. Show that p   q  r  is logically equivalent to  p  q   r .

5. Use the De Morgan’s laws to write negations for the statement below.
The train is late or my watch is fast.

Answers of Additional Questions:

Diploma Asia Pacific University of Technology & Innovation Page 2 of 3


Discrete Mathematics AAQS007-4-1 Propositional Logic

1.
~  p  q    q ~ r 
T
T
T
F
F
F
F
T

2. (a) (i) Today is not Wednesday or it is not a holiday. (ii) x ≥ 2 and x ≤ 5


(b) De Morgan’s Law
3. (a) p  q (b) q  ~ p (c) ~  ~ p  ~ q  or p  q
4.
p  q  r  p  q  r
T T
F F
T T
T T
T T
T T
T T
T T

5. The train is not late and my watch is not fast.

Diploma Asia Pacific University of Technology & Innovation Page 3 of 3

You might also like