Scribd
Upload
27 views3 pages

Discrete Week 3

The document provides a multiple choice exercise and matching questions about logic and quantifiers. It also includes proofs using laws of equivalence and rules of inference to derive conclusions from given premises.

Uploaded by

Ariane Pearl Cuevas Isla
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
27 views3 pages

Discrete Week 3

The document provides a multiple choice exercise and matching questions about logic and quantifiers. It also includes proofs using laws of equivalence and rules of inference to derive conclusions from given premises.

Uploaded by

Ariane Pearl Cuevas Isla
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

ISLA, ARIANE PEARL C.

BSIT 1B
EXERCISE
MULTIPLE CHOICE
1. B
2. A
3. B
4. A
5. A
6. A
7. A
8. A

Matching type. Match column A and B by writing the letter of your choice on the space
provided. (1 pt each)

II. Let L(x, y) be the predicate "x likes y," and


let the universe of discourse be the set of all
people.  Use quantifiers to express each of the
following statements.
a) x L(x, George)
__G___a. Someone does not like anyone. b) x y L(y, x)
__E___b. Everyone likes everyone. c) x y L(y, x)
__F___c. Everyone likes someone. d) x y L(x, y)
___B__d. There is someone whom everyone e) x y L(x, y)
likes.
f) x y L(x, y)
__D___e. Everyone does not like someone.
g) x y L(x, y)
___C__f. There is no one whom everyone
likes.

__A___g. Everyone likes George.


II.
1. Xp(x).
2. ~x p(x).
3. x~p(x).
4. NOT ALL BIRDS CAN’T FLY
5. NO BIRDS CAN FLY
6. SOME BIRDS CAN FLY

III. Prove the following using equivalence laws.


1. (p ^ ¬q) ˅ q = p ˅ q
-DE MORGAN’S LAWS
2. P → P ˅ Q = T
-NEGATION LAWS

IV. Prove the conclusion applying appropriate rule of inference.

A. What is the possible conclusion you can derive from the following premises:
Justify your conclusion using formal proofs. Translate the statements into symbols
indicated. (10 pts)
D = Discrete Structures
I = IT student
M = Math logic
1. I can take Discrete Structures If I am an IT student. D → I
2. If I can take Discrete structures, I can study Math Logic. D→ M
3. I cannot study Math Logic. M
B. Express the following arguments using the symbols indicated.
Show what rules of inference used to come up with the conclusion. (10 pts)
1. Martin is either intelligent or a good singer. I v S
2. If Martin is intelligent, then he can count 1 to 10. I → C
3. Martin can only count from 1 to 5. ~C
4. Therefore, Martin is a good singer.
I = Martin is intelligent.
S = Martin is a good singer.
C = Martin can count from 1 to 10.

You might also like