CSE581 Intuitive Predicate Logic SELF TEST

VERY SHORT QUESTIONS

Some of them will appear on MIDTERM
Circle proper answer. Write clear justification
This Self Test is created to make you practice what you know and how well and quick you can justify it.
It also will help you to remember basic Laws of Quantifiers. All of them and their counter examples are in the book.
Study also restricted domain quantifiers laws and counter examples. There are only
few of them and I didn’t include them here but you must know them too.
For known basic laws of quantifiers you write ”basic tautology” or the name- like - ”distributivity law ”.
If it is not a tautology justification is a mathematical statement that is a counter example.
HAVE FUN!

SHORT QUESTIONS

Circle proper answer. Write justification

1. (∃xA(x) ⇒ ∀xA(x)) is a predicate tautology.

JUSTIFY:
y n
2. For any predicates A(x), B(x),
¬∀x(A(x) ∩ B(x)) ≡ (∃x¬A(x) ∪ ∃x¬B(x)).
JUSTIFY:
y n
3. For any predicates A(x), B, (this means that B does not contain the variable x)
¬∃x(A(x) ∩ B) ≡ ∀x¬(A(x) ∩ ¬B).
JUSTIFY:
y n
4. (A(x) ⇒ A(x)) is a predicate tautology.
JUSTIFY:
y n
5. ∀x(A(x) ∩ B(x)) ≡ (∀xA(x) ∩ ∀xB(x))
JUSTIFY:
y n
6. ∃x(A(x) ∪ B(x)) ≡ (∃xA(x) ∪ ∃xB(x))
JUSTIFY:
y n
7. ∀x(x < 0) ⇒ 2 + 2 , 4 is a true statement in a set of natural numbers.
JUSTIFY:
y n

1
 8. ∀x ∈ R(x2 < 0) ⇒ ∀x ∈ R(x2 ≥ 0)
JUSTIFY:
y n
9. x + y > 0, for x, y ∈ N is a (mathematical) predicate with the domain N.
JUSTIFY:
y n
10. ∃x(x < 1) ∪ 2 + 2 = 4 is a true statement in a set of natural numbers numbers.
JUSTIFY:
y n
11. ∀x ∈ R(x2 ≥ 0) ⇒ ∃x ∈ R(x2 ≥ 0) is a true mathematical statement.
JUSTIFY:
y n
12. ¬∃n∃x(x < 1+n
n+1 ) ≡ ∀n∃x(x ≥ 1+n
n−1 ))
JUSTIFY:
y n
13. ¬∃n∃x(x < 1+n
n+1 ) ≡ ∀n∀x(x ≥ 1+n
n−1 ))
JUSTIFY:
y n
14. The formula ∀x(C(x) ⇒ F(x)) represents sentence: All trees can fly
in a domain X , ∅. JUSTIFY:
y n
15. The formula ∃x(C(x) ∩ B(x) ∩ F(x)) represents sentence: Some blue flowers are yellow in a domain X , ∅.
JUSTIFY:
y n
16. For any predicates A(x), B(x), the formula
((∀xA(x) ∪ ∀xB(x)) ⇒ ∀x(A(x) ∪ B(x))) is a predicate tautology.
JUSTIFY:
y n
17. ∃xA(x) ⇒ ∀xA(x) is a predicate tautology.
JUSTIFY:
y n
18. ¬∀x(A(x) ∩ B(x)) ≡ (¬∀xA(x) ∪ ∃x¬B(x)).
JUSTIFY:
y n
19. ¬∃x(A(x) ∩ B) ≡ ∀x¬(A(x) ∪ ¬B).
JUSTIFY:
y n
20. (A(x) ⇒ A(x)) is a predicate tautology.
JUSTIFY:
y n
21. ∀x(A(x) ∩ B(x)) ≡ (∀xA(x) ∪ ∀xB(x))
JUSTIFY:
y n

2
22. ∃x(A(x) ∪ B(x)) ≡ (∃xA(x) ∪ ∃xB(x))
JUSTIFY:
y n
23. ∀x(x < 1) ∪ 2 + 2 , 4 is a true statement.
JUSTIFY:
y n
24. x + y > 0, for x, y ∈ N is a (mathematical) predicate with the domain N.
JUSTIFY:

25. ∀x ∈ R(x2 < 0) ⇒ ∃x ∈ R(x2 > 0) is a true mathematical statement.

JUSTIFY:
y n
26. ¬∀n∃x(x < 1+n
n+1 ) ≡ ∃n∀x(x ≥ 1+n
n−1 ))
JUSTIFY:
y n
27. x + y > 0, for x, y ∈ N is a (mathematical) predicate with the domain N.
JUSTIFY:
y n
28. (∃x(A(x) ∪ B(x))) ≡ (∃xA(x) ∪ ∃xB(x))
JUSTIFY:
y n
29. ∀x(x < 1) ∪ 2 + 2 , 4 is a true statement.
JUSTIFY:
y n
30. ∀x ∈ R(x2 < 0) ⇒ ∃x ∈ R(x2 > 0) is a true mathematical statement.
JUSTIFY:
y n
31. The formula ∀x(C(x) ∩ F(x)) represents sentence: All birds can fly in in the domain X , ∅.
JUSTIFY:
y n
32. For any propositional function A(x) the formula
(∀xA(x) ⇒ ∃xA(x)) is a predicate tautology.
JUSTIFY:
y n
33. For any predicates A(x), B, (this means that B does not contain the variable x) the formula
(∀x(A(x) ⇒ B) ⇒ (∃xA(x) ⇒ B)) is a predicate tautology.
JUSTIFY:
y n
34. For any predicates A(x), B(x), the formula
(∃x((A(x) ∩ B(x)) ⇒ (∃xA(x) ∩ ∃xB(x))) is a predicate tautology.
JUSTIFY:
y n

3
35. For any propositional functions A(x), B(x), the formula
(∀x(A(x) ∪ B(x)) ⇒ (∀xA(x) ∪ ∀xB(x))) is a predicate tautology.
JUSTIFY:
y n
36. For any predicates A(x), B(x), the formula
(∀x(A(x) ⇒ B(x)) ⇒ (∀xA(x) ⇒ ∀xB(x))) is a predicate tautology.
JUSTIFY:
y n
37. For any predicates A(x), B(x), the formula
(∃x(A(x) ⇒ B(x)) ⇒ (∀xA(x) ⇒ ∃xB(x))) is a predicate tautology.
JUSTIFY:
y n
38. For any predicates A(x), B(x), the formula
(∀x((A(x) ∩ B(x)) ⇒ (∃xA(x) ∩ ∃xB(x))) is a predicate tautology.
JUSTIFY:
y n
39. For any propositional function A(x) the formula
(∀xA(x) ⇒ ∀A(x)) is a predicate tautology.
JUSTIFY:
y n
40. For any predicates A(x), B, (this means that B does not contain the variable x) the formula
∀x(A(x) ⇒ B) ⇒ (∃xA(x) ⇒ B) is a predicate tautology.
JUSTIFY:
y n
41. For any predicates A(x), B(x), the formula
(∃x((A(x) ∩ B(x)) ⇒ (∃xA(x) ∩ ∃xB(x))) is a predicate tautology.
JUSTIFY:
y n
42. For any predicates A(x), B(x), the formula
∀x(A(x) ∪ B(x)) ⇒ (∀xA(x) ∪ ∀xB(x)) is a predicate tautology.
JUSTIFY:
y n
43. For any predicates A(x), B(x), the formula
(∀x(A(x) ⇒ B(x)) ⇒ (∀xA(x) ⇒ ∀xB(x))) is a predicate tautology.
JUSTIFY:
y n
44. For any predicates A(x), B(x), the formula
((∃xA(x) ∩ ∃xB(x)) ⇒ ∃x(A(x) ∩ B(x))) is a predicate tautology.
JUSTIFY:
y n