0% found this document useful (0 votes)
8 views10 pages

Exam 4

Past Exam Logic And Set Theory TUE Eindhoven
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views10 pages

Exam 4

Past Exam Logic And Set Theory TUE Eindhoven
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

0021.

pdf 0092518701

Exercises
1 2 3 4 5 6
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 (on campus)
8 8 8 8 8 8 8

9 9 9 9 9 9 9

0 0 0 0 0 0 0

This exam 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 (most importantly!) 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 cross out the same numbers in the columns
below. Furthermore, you should write all your solutions in the designated areas under the questions. If
you need more space, please use the extra space provided on pages 9 and 10 of the form. You may use
scrap paper to draft your solutions, but scrap paper will not be taken into account when grading your
test (in fact, it will not be taken in at all).

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

You can obtain 30 points in total by solving all problems in this test correctly; how many points you
can obtain with a correct solution for a problem is indicated before the number of the problem. Note that
a partially correct solution is sometimes awarded with a fraction of the points. Your grade for this final
test will be determined by dividing the total number of points you scored by 3.

After all tests have been graded, you can review the grading of your test in Ans and ask questions
about the grading there. You will receive an invitation to review the grading of your final test through a
Canvas announcement.

1 / 10
0021.pdf 0092518702

Formal Reasoning
5p 1 Prove with a flag-style derivation (i.e. using the methods described in part II of the book) that the
formula

(¬P ∨ Q) ⇒ (P ⇒ (Q ∨ R))

is a tautology.

2 / 10
0021.pdf 0092518703

Predicate Logic

Let H be the set of all human beings, including Anna, Boris and Carlos.

Furthermore, let M be a unary predicate on H and let P and G be a binary predicates on H


with the following interpretations:

M (x) : ’x is male’;
P (x, y) : ’x is a parent of y’;
G(x, y) : ’x is a grandparent of y’.

Give formulas of predicate logic that express the following two sentences:
2p 2a "Boris and Carlos are (half) brothers."

2p 2b "Anna does not have nephews." (A nephew of Anna is the son of a brother or sister of Anna.)

3 / 10
0021.pdf 0092518704

Sets
5p 3 Let A, B and C be arbitrary sets. Prove that

A ∩ B ⊆ C ⇒ A / C ⊆ Bc .

4 / 10
0021.pdf 0092518705

Relations
Let R be the relation on Z × Z defined, for all x1 , x2 , y1 , y2 ∈ Z, by:

(x1 , x2 ) R (y1 , y2 ) if, and only if, x 1 + y 2 = x 2 + y1 .

5p 4a Prove that R is an equivalence relation.

5 / 10
0021.pdf 0092518706

2p 4b Let [(1, 2)]R denote the equivalence class of (1, 2) with respect to R. (This is according to the
notation used in the videos; according to the notation used in the book, the same equivalence class
would be denoted by K((1, 2)) .) Furthermore, let A = {−2, −1, 0, 1, 2}

Determine [(−1, 2)]R ∩ (A × A).

6 / 10
0021.pdf 0092518707

Induction
6p 5 Prove that 2n ≥ n2 for all n ∈ N with n ≥ 4.

7 / 10
0021.pdf 0092518708

Orderings
3p 6 Let R be the reflexive ordering on N+ , defined, for all x, y ∈ N+ , by:

xRy if, and only if, ∃c [c ∈ N+ ∶ y = xc ]

(recall that N+ = {n ∈ N ∣ n > 0}).

Furthermore, let A = {1, 2, 3, 4, 5, 6, 7, 8, 9}.

Give the Hasse diagram of ⟨A, R⟩.

8 / 10
0021.pdf 0092518709

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. 9.

9 / 10
0021.pdf 0092518710

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. 10.

10 / 10

You might also like