0001.

pdf 0239923401

Exercises
1 2 3 4 5 6 7
1 1 1 1 1 1 1

2 2 2 2 2 2 2
Surname, First name
3 3 3 3 3 3 3

4 4 4 4 4 4 4

5 5 5 5 5 5 5

6 6 6 6 6 6 6
Logic and Set Theory (2IHT10)
7 7 7 7 7 7 7
Exam
29 June, 2023, 18:00-21:00 8 8 8 8 8 8 8

9 9 9 9 9 9 9

0 0 0 0 0 0 0

a b c d e f → b, d
a b c d e f →b
a b c d e f →c a b c d e f →c
b c d e f →a a b c d e f → a, d

Fill in your answer(s) to the multiple-choice questions as shown above (circles = one correct answer,
boxes = multiple correct answers possible).

This form will be scanned and graded in the online system Ans. It will be automatically associated
with your identity in Ans on the basis of the information you provide above. It is therefore very important
that you fill in your name and accurately complete the table at the top right of this page: fill in your student
id in the top row of the table and then fully color the appropriate circles below. On the examination
attendance card, you need to fill in the PDF number (the number at the top left of the first page).

You should write all your solutions in the designated areas under the questions. If you need more
space than the designated area provides, then use the extra space provided at the end of the form. It is
mandatory to hand in all pages of the form. You may also use scrap paper to draft your solutions, but
scrap paper will not be taken into account when grading your test. Use a pen in a color that will come
across clearly when your work is scanned; do not use a pencil to write (the final version of) your solutions.

You are not allowed to use any books, notes, or other course material. Your solutions have to be formulated
and written down in a clear and precise manner.

In total, you can score 20 points, and your grade for this exam will be determined by dividing the total
number of points you scored by 2, rounding to the nearest integer. You pass the course if your grade for
this exam is at least 6.

Important:
• You are only permitted to visit the toilets under supervision
• Examination scripts (fully completed examination paper, stating name, student number, etc.) must
always be handed in
• The house rules must be observed during the examination
• The instructions of subject experts and invigilators must be followed

1 / 12
 0001.pdf 0239923402

• Keep your work place as clean as possible: put pencil case and breadbox away, limit snacks and
drinks
• You are not permitted to share examination aids or lend them to each other
• Do not communicate with any other student by any means

During written examinations, the following actions will in any case be deemed to constitute fraud or
attempted fraud:
• using another person’s proof of identity/campus card (student identity card)
• having a mobile telephone or any other type of media-carrying device on your desk or in your clothes
• using, or attempting to use, unauthorized resources and aids, such as the internet, a mobile telephone,
smartwatch, smart glasses etc.
• having any paper at hand other than that provided by TU/e, unless stated otherwise
• copying (in any form)
• visiting the toilet (or going outside) without permission or supervision

Good luck with the exam!

2 / 12
 0001.pdf 0239923403

Propositions
0.5p 1a Let c and d be proposition variables. Then (c ∧ ¬d) ⇒ d is:

a a tautology
b a contingency
c a contradiction

0.5p 1b Let c and d be proposition variables. Then (c ∧ ¬d) ⇒ c is:

a a tautology
b a contingency
c a contradiction

Truth of predicates
2p 2 Define propositions P , Q and R as follows:

P = ∀x [x ∈ N ∶ ∃y [y ∈ N ∶ y < x]]
Q = ∀x [x ∈ N ∶ ∃r [r ∈ R ∶ r < x]]
R = ∃m [m ∈ N ∶ ∀n [n ∈ N ∶ m ≤ n]]

Select all true statements:

val
P ⊧ Q
val
Q ⊧ P
val
P = Q
val
P ≠ Q

P and Q are incomparable

val
Q ⊧ R
val
R ⊧ Q
val
Q = R
val
Q ≠ R

Q and R are incomparable

3 / 12
 0001.pdf 0239923404

Predicate logic
Let B be the set of all bikes, and let C be the set of all cyclists. Let Tom be a cyclist (i.e., Tom ∈ C).
Furthermore, let S be a predicate on C×B, and let R be a predicate on B with the following interpretations:

S(c, b) ∶ cyclist c is steering bike b

R(b) ∶ bike b is on the road

Give formulas of predicate logic that express the following two statements (in addition to the two
predicates given above you may also use the binary equality predicate = on B and on C).
1p 3a Tom is not steering a bike that is on the road.

2p 3b All bikes on the road are steered by at least two cyclists.

4 / 12
 0001.pdf 0239923405

Derivation with quantifiers

3p 4 Prove with a flag-style derivation that the following formula is a tautology:

∃x [x ∈ N ∶ P (x) ⇒ Q(x)] ⇒ (∀z [z ∈ N ∶ ¬Q(z)] ⇒ ∃y [y ∈ N ∶ ¬P (y)])

5 / 12
 0001.pdf 0239923406

Induction
4p 5 Prove that every integer larger than 23 can be written as the sum of a multiple of five and a multiple
of seven.

6 / 12
 0001.pdf 0239923407

Sets and mappings

Let the mapping F ∶ P(N) → P(N) be defined, for all X ∈ P(N), by

F (X) = X ∩ {2, 3, 4} .

So, for example, F ({1, 2}) = {2} and F ({5}) = ∅.

2p 6a Prove that for all X, Y ∈ P(N) if X ⊆ Y , then F (X) ⊆ F (Y ).

7 / 12
 0001.pdf 0239923408

1p 6b Is F a surjection? (Motivate your answer with a proof or a counterexample.)

1p 6c Determine F (P({4, 5, 6})) (i.e., the image of P({4, 5, 6}) ⊆ P(N) under F ).

8 / 12
 0001.pdf 0239923409

Orderings
For mappings f, g ∶ N → N we define

f Rg iff ∃x [x ∈ N ∶ f (x) < g(x)]

and
f Sg iff ∀x [x ∈ N ∶ f (x) < g(x)].

1p 7a Prove or disprove that R is transitive.

9 / 12
 0001.pdf 0239923410

1p 7b Prove or disprove that S is transitive.

1p 7c Define f1 , f2 , f3 , f4 ∶ N → N by

f1 (x) = x + 1,
f2 (x) = x + 4,
f3 (x) = x2 ,
f4 (x) = x2 + 3

for all x ∈ N. Draw a Hasse diagram of ⟨{f1 , f2 , f3 , f4 }, S⟩.

10 / 12
 0001.pdf 0239923411

Extra space
If you need extra space, you can write (part of) a solution below. Please state clearly, in the box associated
with the question to which this solution belongs, that we should look for the (rest of the) solution on p. 11.

11 / 12
 0001.pdf 0239923412

Extra space
If you need extra space, you can write (part of) a solution below. Please state clearly, in the box associated
with the question to which this solution belongs, that we should look for the (rest of the) solution on p. 12.

12 / 12