Scribd
Upload
326 views3 pages

Mat101 1

The document provides examples of constructing truth tables and using them to determine if a compound proposition is a tautology, contradiction, or contingency. It also gives examples of using truth tables to prove that a proposition is a tautology and using De Morgan's laws to write the negations of propositions. Specifically, it shows truth tables for the propositions (P ∧ ¬p), (p v ¬q) ∧ r, and p ∧ (q v ¬q). It then analyzes the propositions (P ∧ Q) v (¬P ∧ ¬Q) and (P ∧ Q) v (¬P v ¬Q) to determine if they

Uploaded by

Julpae Piris
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
326 views3 pages

Mat101 1

The document provides examples of constructing truth tables and using them to determine if a compound proposition is a tautology, contradiction, or contingency. It also gives examples of using truth tables to prove that a proposition is a tautology and using De Morgan's laws to write the negations of propositions. Specifically, it shows truth tables for the propositions (P ∧ ¬p), (p v ¬q) ∧ r, and p ∧ (q v ¬q). It then analyzes the propositions (P ∧ Q) v (¬P ∧ ¬Q) and (P ∧ Q) v (¬P v ¬Q) to determine if they

Uploaded by

Julpae Piris
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/ 3

Activity 1.11 Truth Table Construction.

Construct a truth table for each of the following compound propositions.


a. p ʌ ~p

p ~p
T F
F T

d. (p v ~q) ʌ r

p q r ~q (p v ~q) (p v ~q) ʌ r

T T T F T T
T T F F T F
T F T T T T
T F F T T F
F T T F F F
F T F F F F
F F T T T T
F F F T T F

f. p ʌ (q v ~q)

p q ~q (q v ~q) p ʌ (q v
~q)

T T F T T
T F T T T
F T F T F
F F T T F

Activity 2.1 Tautology, Contradiction, Contingency


Use a truth table to determine whether each of the following is a tautology, a
contradiction, or contingency.

1. (P ʌ Q) v (~P ʌ ~Q)

P Q ~P ~Q (P ʌ Q) (~P ʌ ~Q) (P ʌ Q) v (~P ʌ ~Q)

T T F F T F T
T F F T F F F
F T T F F F F
F F T T F T T

Since the compound proposition (P ʌ Q) v (~P ʌ ~Q) has a truth value of two T
and two F, then it is contingency.
2. (P ʌ Q) v (~P v ~Q)

P Q ~P ~Q (P ʌ Q) (~P v ~Q) (P ʌ Q) v (~P v ~Q)

T T F F T F T
T F F T F T T
F T T F F T T
F F T T F T T

Since the compound proposition (P ʌ Q) v (~P v ~Q) has a truth value of T for any
combination, then (P ʌ Q) v (~P v ~Q) is a tautological proposition.

Activity 2.2 Proving Tautology.


Construct a truth table for each of the following compound propositions to prove they
are tautologies.
b. [P v (Q v R)] ↔ [(P v Q) v R]

P Q R (Q v R) (P v Q) [P v (Q v R)] [(P v Q) v R] [P v (Q v R)] ↔ [(P v Q) v R]


T T T T T T T T
T T F T T T T T
T F T T T T T T
T F F F T T T T
F T T T T T T T
F T F T T T T T
F F T T F T T T
F F F F F F F T

Since the compound proposition [P v (Q v R)] ↔ [(P v Q) v R] has truth value always T
for any combination, then it is a tautological proposition.

d. (P v P) ↔ P

P (P v P) (P v P) ↔ P
T T T
F F F

Since the compound proposition [P v (Q v R)] ↔ [(P v Q) v R] has truth value always T
for any combination, then it is a tautological proposition.
Activity 2.4 Using De Morgan’s Law To Write Negations.
Use De Morgan’s Law to write the negations for the following propositions.
1. Hal is a math major and Hal’s sister is a computer science major.
Solution:
Hal is not a math teacher or Hal’s sister is not a computer science major.

2. Sam is an orange belt and Kate is a red Belt


Solution:
Sam is not an orange belt or Kate is no a red belt.

3. The connector is loose or the machine is unplugged.


Solution:
The connector is not loose and the machine is not unplugged.
The connector is tight and the machine is plugged.

4. The bus is late or my watch is fast.


Solution:
The bus is not late and my watch is no fast.
Neither the bus is not late nor my watch is fast.

5. Rita will move to Oregon or Washington.


Solution:
Rita will not move to Oregon and Washington.
Neither Rita will move to Oregon nor Washington.

You might also like