Scribd
Upload
9 views8 pages

Constructing Truth Tables in Logic

This document provides an overview of constructing truth tables and translating statements between logical and English forms. It defines several propositions using logical variables and demonstrates how to symbolize English statements and translate symbolic statements into English. Examples are given of constructing truth tables for compound propositions involving multiple variables and logical connectives like conjunction, disjunction, and negation. Practice problems are included for students to write statements using logical variables and to construct truth tables.

Uploaded by

Renzo Arvin Matias
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
9 views8 pages

Constructing Truth Tables in Logic

This document provides an overview of constructing truth tables and translating statements between logical and English forms. It defines several propositions using logical variables and demonstrates how to symbolize English statements and translate symbolic statements into English. Examples are given of constructing truth tables for compound propositions involving multiple variables and logical connectives like conjunction, disjunction, and negation. Practice problems are included for students to write statements using logical variables and to construct truth tables.

Uploaded by

Renzo Arvin Matias
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

DYBCSDms113; DYBITDms113; DYCPEDis123:

Discrete Structures

MARY ANN T. LIM


Faculty, College of Computer Studies

Declaration:
This learning module is an exclusive property of Dr. Yanga’s Colleges, Inc., as an essential part of the
REIMAGINED Learning Program for the Academic Year 2020-2021, and shall only be used by and for
DYCIans. No part of this learning module shall be reproduced, distributed, transmitted, and/or sold, without
the consent of DYCI.
<<Week No. 9>>
<<Constructing Truth Tables>>

This module is a continuation of the application of logic, propositions, logical


connectives and constructing truth tables.

At the end of this module, you are expected to:


1. Construct truth tables of propositions.
2. Translate English statement to mathematical logic.

Propositions logic are presented usually in its symbolic form using propositional
variables and logical connectives.

Let’s apply groupings in its symbolic form using parenthesis.

Let p: 0 is a negative number


q: -5 is a negative number
r:  3 is irrational.

Symbolize the following statements:

1. 0 and -5 are both not negative numbers.


Answer: ~p  ~q - both not means negating both propositions.

2. 0 and -5 are not both negative numbers.


Answer: ~ ( p  q ) - not both means negating the result of anding of two
propositions.

3. Either 0 is a negative number or -5 is a negatie number and  3 is irrational.

1
Answer: ( p  q )  r - Either comes with an or that is why variable p and q
are placed inside the parenthesis and the result of the oring (  ) is
then conjunct (and) with r.

4. Either 0 is a positive number or -5 is a negative number but they are not both
negative numbers.
Answer: ( p  q )  ~ ( p  q ) - first grouping is the either or ( p  q )
Second grouping not both ( p  q )
These groupings are combined using but
which means anding of two compound
propositions.

Let’s try now to translate the following into English statements.

Let p: Today is Sunday.


q: I will stay at home.
r: I’m not going to work.

1. p  ~q - Today is Sunday and I will not stay at home.


2. ~p  q - It is not Sunday today but I will stay at home.
3. r~q - I’m not going to work or I will not stay at home.
4. ( p  q)  ~r - It is both Sunday today and I will stay at home or I’m
going to work.
5. ~p  ( ~q  ~r ) - Today is not Sunday and either I will not stay at home or
I’m going to work.

Constructing Truth Table

As we have discussed on our previous module, There are 2n possible combinations


of truth values to be considered in the truth table where n is the number of propositional
variables. To construct truth table of a compound proposition, let’s have this example.

2
1. p  ~q
- 2n is 22 = 4
- 4 different combinations of truth values from 2 propositional variables

- Negate first q.

- Disjunct p and ~q.

Table 9.1 Truth Table of p  ~q

3
1. (~ p  ~q)  (p  r)
- 2n is 23 = 8
- 8 different combinations of truth values from 3 propositional variables

- Negate p and q. (~ p  ~q)  (p  r)

- Evaluate (~ p  ~q) and (p  r)

4
- (~ p  ~q)  (p  r)

Table 9.2 Truth Table of


(~ p  ~q)  (p  r)

5
Name: _____________________________________________ Rating: ________________
Year and Section:_____________ Professor / Instructor: __________________________
Due of Submission: _____________________________

<< Week No.9>>


<< Constructing Truth Table >>

Let p: 2 + 2 = 4
q: 9 is a natural number.
r: 8 is divisible by 2.

I. Write the following statements in terms of p, q and r using logical connectives.

________________ 1. 2 + 2 = 4 and 8 are divisible by 2.


________________ 2. It is not the case that both 9 is a natural number and 2+2 =4.
________________ 3. 2+2 =4 but 8 is not divisible by 2.
________________ 4. It is not true that 9 is a natural number but 2+2=4.
________________ 5. Neither 8 is divisible by 2 nor 9 is a natural number.

II. Construct the truth table of the following compound propositions.

1. ~p  ( q  r)

2. (~p  q)  ~p

6
Malang, P., Malang, B., Tiongson I. and Sandoval, C. 2011. Discrete Structures. HFM
Publishing

Common questions

Powered by AI

Transforming involves identifying each atomic proposition, assigning variables, identifying logical connectives (such as not, and, or), and recreating these relationships with symbolic operators such as '~', '&', and '||' .

Negating a conjunction like '(p & q)' results in '~ (p & q)', which implies that at least one of the propositions may not hold true. In contrast, negating individually, '~p & ~q', means neither holds true. The former is about the joint scenario not happening, whereas the latter denies both individually .

The statement is symbolized as '~q & p'. The word 'but' acts like 'and', hence why '9 is a natural number' and '2+2=4' are joined, and negation applies only to 'q' .

To construct a truth table with three propositional variables, one must evaluate 2^3 = 8 different combinations of truth values. Each combination represents a possible configuration for the variables. The process involves negating and/or conjoining variables as needed and calculating the truth values for the entire expression systematically .

Exponentiation, specifically 2^n, provides the number of rows needed, where n is the number of propositional variables. This exponentiation accounts for every possible truth-value configuration of the variables in a compound expression .

The compound proposition '~p & (q \/ r)' translates to '2+2≠4 and either 9 is a natural number or 8 is divisible by 2'. This explains the negation of 'p' in combination with the disjunction between 'q' and 'r' .

Evaluate accuracy by checking consistency across all possible rows (2^n combinations); confirm each row corresponds to inputs and logical operations defined within the proposition. Comparisons with known logical equivalence or correctness provides additional verification .

The expression 'r \/ ~ q' translates to 'I’m not going to work or I will not stay at home' .

The proposition is symbolized as '(p \/ q) & ~ (p & q)'. The first part '(p \/ q)' translates 'either...or', and '~(p & q)' translates 'not both...' emphasizing they can't both be negative simultaneously .

The statement can be symbolized as '~p  ~q', where '~' denotes negation, and '' denotes conjunction. This means negating both propositions (0 is a negative number and -5 is a negative number) and then '&' joining them .

You might also like