0% found this document useful (0 votes)
22 views2 pages

2nd Assi Discrete Structure

The document consists of three main tasks: completing a truth table for logical propositions, evaluating a propositional function P(x) for specific values and determining their truth values, and analyzing a partially ordered set (POSET) to see if it forms a lattice. The evaluations show that P(2) is true while P(-4) and P(-3) are false, indicating the existence of at least one true case (∃x P(x)). Lastly, the document requires the use of a Hasse Diagram to identify the greatest lower bounds and least upper bounds for the elements in the given POSET.

Uploaded by

Emma
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
0% found this document useful (0 votes)
22 views2 pages

2nd Assi Discrete Structure

The document consists of three main tasks: completing a truth table for logical propositions, evaluating a propositional function P(x) for specific values and determining their truth values, and analyzing a partially ordered set (POSET) to see if it forms a lattice. The evaluations show that P(2) is true while P(-4) and P(-3) are false, indicating the existence of at least one true case (∃x P(x)). Lastly, the document requires the use of a Hasse Diagram to identify the greatest lower bounds and least upper bounds for the elements in the given POSET.

Uploaded by

Emma
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

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 element 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 (∀).

You might also like