SECOND ASSIGNMENT (DISCRETE STRUCTURE)
1. Complete the Truth Table below:
P Q R (P ---> Q) (Q ---> R) (P ---> Q) v (Q --->
R)
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
2. Consider the propositional function P(x) defined as: x 3 + x2 – 1 > 5,
then what are the truth value of P(2), P(–4) and P(–3). Indicate with
notation whether the propositions satisfy Universal or Existential
quantifier.
3. With a Hasse Diagram, determine whether this POSET: ({1, 2, 3, 4, 6,
8, 12, 24},|) is a lattice or not. (Show the Greatest Lower Bound (GLB)
and Least Upper Bound (LUB) for every pair of elements and state your
reason).
Number 2
Evaluating Propositional Function P(x)
Given the propositional function:
\[ P(x): x^3 + x^2 - 1 > 5 \]
Evaluating P(2):
\[ P(2): 2^3 + 2^2 - 1 > 5 \]
\[ P(2): 8 + 4 - 1 > 5 \]
\[ P(2): 11 > 5 \]
\[ P(2) \text{ is } \boxed{\text{True}} \]
Evaluating P(-4):
\[ P(-4): (-4)^3 + (-4)^2 - 1 > 5 \]
\[ P(-4): -64 + 16 - 1 > 5 \]
\[ P(-4): -49 > 5 \]
\[ P(-4) \text{ is } \boxed{\text{False}} \]
Evaluating P(-3):
\[ P(-3): (-3)^3 + (-3)^2 - 1 > 5 \]
\[ P(-3): -27 + 9 - 1 > 5 \]
\[ P(-3): -19 > 5 \]
\[ P(-3) \text{ is } \boxed{\text{False}} \]
Quantifiers:
- Universal Quantifier (∀): For all x, P(x) is true.
- Existential Quantifier (∃): There exists an x such that P(x) is true.
Given the truth values:
- P(2) is True
- P(-4) is False
- P(-3) is False
∃x P(x) is true, since P(2) is true.
We can say:
∀x P(x) is false, since P(-4) and P(-3) are false.
- ∃x P(x) (There exists an x such that P(x) is true)
Notation:
- ¬∀x P(x) (Not for all x, P(x) is true)
In summary, P(2) is true, while P(-4) and P(-3) are false. The propositional function P(x) satisfies the
existential quantifier (∃) but not the universal quantifier (∀).
Example 3.1.2. Analyze the statement, “if you get more doubles than any other player you will lose,
or that if you lose you must have bought the most properties,” using truth tables.
Solution 3.1.2. Let’s start by breaking down the molecular statement into atomic statements. Let P be
the statement “you get more doubles than any other player,”; Q be the statement “you will lose,” and
represent the statement as this symbol (P → Q) ∨ (Q → R).
R be the statement “you must have bought the most properties.” Now let’s construct a truth table to
lOMoARcPSD|56830136 20
The truth table needs to contain 8 rows in order to account for every possible combination of truth
and falsity among the three statements. Here is the full truth table:
P Q R (P→Q (Q → (P
∨ (Q
) R) →Q)
→ R)
T T T T T T
T T F T F T
T F T F T T
T F F F T T
F T T T T T
F T F T F T
F F T T T T
F F F T T T
This is a true statement about monopoly, such that it is regardless of how many properties you own,
how many doubles you roll, or whether you win or lose, the outcome is true for all 8 possible
combinations.
The statement about monopoly in example 3.1.2 is an example of a tautology. Tautology is a
statement which is true on the basis of its logical form alone. Tautologies are always true but they
don’t tell us much about the world. No knowledge about monopoly was required to determine that
the statement was true.
