Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
92 views

Homework Logic

This document provides homework problems on propositional logic and predicate logic for classes 1 and 2. It includes exercises on translating statements to propositional logic, checking logical validity using truth tables, writing statements in conjunctive and disjunctive normal form, proving tautologies, quantifiers, and translating statements to logical notation. Practice exam questions are provided at the end.

Uploaded by

Thijs Ortmans
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
92 views

Homework Logic

This document provides homework problems on propositional logic and predicate logic for classes 1 and 2. It includes exercises on translating statements to propositional logic, checking logical validity using truth tables, writing statements in conjunctive and disjunctive normal form, proving tautologies, quantifiers, and translating statements to logical notation. Practice exam questions are provided at the end.

Uploaded by

Thijs Ortmans
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

HOMEWORK LOGIC, CLASSES 1+2

c MICHIEL HOCHSTENBACH, TU EINDHOVEN, 2022

Answers will be available soon, but it is very important to first try the exercises
yourself for quite some time!

1. Translate the following reasonings to the language of proposition logic and check using a
truth table whether they are logically correct:
(a) If John is ill, he does not go to class.
John is not ill.
Therefore: John goes to class.
(b) Pete passes the exam, and Quirine or Rick pass (or they both pass).
Therefore: Pete and Quirine pass, or Pete and Rick pass (or they all pass).

2. Check using the truth table of p → q whether the following reasonings are logically correct.
(a) If p and (p → q), then q
(b) If (p → q) and ¬p, then ¬q
(c) If (p → q) and ¬q, then ¬p

3. Translate the following sentences to the language of proposition logic:


(a) If the weather is beautiful tomorrow, I will come.
(b) I will come tomorrow only when the weather is beautiful.

4. Give a truth table for p → (p ∨ q) (use 4 columns, of which 1 auxiliary column for p ∨ q)

5. Prove or disprove (= refute) by using a truth table


(a) (p ∨ q) ↔ ¬(p → q) (use a column for p ∨ q, and one for ¬(p → q))
(b) (p ∧ q) → p
(c) ¬(p → p)

6. For which truth values of p and q does (p → q) ↔ (q → p) hold?

7. Suppose that we create a new operator “#” with the following truth table
p q p#q
0 0 1
0 1 1
1 0 0
1 1 0
(a) Write this operator in terms of p and q, only using the logical operators ∨, ∧, and ¬.
(List all cases with “ones”)
(b) Can you write it even easier?
(Look carefully at the structure of the zeros and ones.)

1
8. We want to provide a logical formula that yields the following truth table:
p q r ???
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
(a) Give a formula only using ∨, ∧, and ¬.
(b) Give a formula only using ∧ and →.

9. We have seen in class that we can write every logical operator using only ∨, ∧, and ¬.
Is this also possible using only ¬, →, and ∧ ?

10. Write in conjunctive and disjunctive normal form (CNF and DNF):
(work according to the step-by-step plan)
(a) p ↔ q
(b) (p ∨ q) ∧ (r ∨ s)
(c) ¬((p → q) ∧ (¬r))
(d) p ∨ q ∨ (¬r)

11. Show by means of a truth table that the following propositions are tautologies:
(a) (p ∧ q) ∨ ¬q ↔ (p ∨ ¬q)
(b) (p ∨ q) ∧ ¬q ↔ (p ∧ ¬q)
(c) ((p → p) → p) → p

12. Prove or disprove that the following propositions are tautologies (i.e. hold for all truth
values of p and q)
(a) p → (q → p)
(b) ((p → q) ∧ ¬p) → ¬q
(c) ((p → q) ∧ ¬q) → ¬p
(d) ¬(p ∨ q) ↔ (¬p ∧ ¬q)
(e) ¬(p ∧ q) ↔ (¬p ∨ ¬q)
(f ) ¬(p → q) ↔ (p ∧ ¬q)

2
13. True or false? Show it, or provide a counterexample:
(a) ∀x ∈ R ∃y ∈ R x+y =0
(b) ∀x ∈ N ∃y ∈ N x+y =0
(c) ∀x ∈ N ∃y ∈ R y2 = x
(d) ∀x ∈ N ∃y ∈ Q y 2 = x
(e) ∃x ∈ Z ∀y ∈ Z x · y = y
(f ) ∃x ∈ R ∀y ∈ R x+y =y

14. Refute the following formulas by giving counterexamples, that is, choose suitable properties
and relations such that the interpreted formula is false.
(a) ∃x ∀y ϕ(x, y) ↔ ∀y ∃x ϕ(x, y)
(b) (∃x ϕ(x) ∧ ∃y ψ(y)) → ∃x (ϕ(x) ∧ ψ(x))
(c) ∀x ∃y ϕ(x, y) → ∃z ϕ(z, z)

15. Translate the following statements in logical symbols and predicates.


(a) Between every 2 different real numbers there is a rational number.
(b) All positive numbers have a square root.
(c) Not every natural number is the sum of the squares of 2 natural numbers.
(d) The function f assumes only positive values (NL: assume = aannemen).
(e) The graph of the function f does not intersect the x-axis.
√
(f ) 2 is not rational
Use only natural numbers and the arithmetic operations
(g) a and b are sisters
Predicates: x is mother of y: M (x, y); x is female: F (x)
(h) Everyone has 2 grandmothers
Predicates: x is parent of y: P (x, y); and F (x)
(i) All mothers are women (tip: how to say: “x is a mother”?)
Predicates: M (x, y), F (x)
(j) Some children have no sister (tip: how to say: “x is a child”?)
predicates: M (x, y), F (x)
(k) Some people like everybody who likes them
Predicates: x likes y: L(x, y)
(l) Everyone has at most 1 mother
Predicate: M (x, y)
(m) After every natural number comes an even number.
Predicates: smaller than: <, even E(x).
(n) Idem, but now use: predicate <; function · (multiplication)
(o) m and n have no common divisors (that is, the greatest common divisor is 1)
Predicate: a is a divisor of b: a | b.
(p) The largest divisor of n is 7
Predicates: a | b, ≤.

3
(q) The smallest true divisor of n is 7 (NB: this means a divisor > 1 and < n)
Predicates: a | b, <, =.

16. Express in English and explain:


(a) ∀x ∈ R : x > 0 → ∃y ∈ R : x = y · y
(b) ∃x ∈ N ∀y ∈ N : x | y
(c) ∀x, y ∈ R : (x < y) → (∃z ∈ Q : x < z < y)
(d) ∀n ∈ N ∃x ∈ R : x sin(x) > n

17. In this assignment we will use the following notations:


N (x) x is Dutch
R(x) x is able to read
B(x) x is a book
K(x, y) x buys y
x 6= y x is different from y
c Chantal
d Daniel
Now try to translate the following sentences as well as possible to the language of predicate
logic.

(a) All Dutch people buy books.


(b) Not all Dutch people buy books.
(c) Chantal, who is able to read, never buys a book.
(d) Everyone who is able to read will buy a book.
(e) Everyone who buys a book is able to read.
(f ) Daniel is able to read and has bought at least two books.

18. Translate from Latin, and explain using the truth table of p → q:
“Ex vero nisi verum, ex falso sequitur quodlibet”.

19. If John walks, Pete bikes; and if Pete bikes, John walks. Who arrives home first?

20. Practice past exam questions: 2, 4, 6 of 20211104; 2, 4, 5 of 20220121; 2, 4, 5 of 20201029;


2, 4, 5, 11 of 20210121;

You might also like