Scribd
Upload
36 views2 pages

CS719 Mid-Semester Exam: Max Marks: 50 Time: 2 Hours

The document outlines the details of a mid-semester exam for the course CS719 including: - The exam is open book, notes, and materials - Answers should be brief and directly address the questions - Students may make reasonable assumptions but unreasonable ones may be penalized - Students should not copy others' work or cheat; those who do will fail the exam The exam then provides 4 questions covering topics in logic, proofs, and set theory to be answered within the 2 hour time limit.

Uploaded by

ullasop
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
36 views2 pages

CS719 Mid-Semester Exam: Max Marks: 50 Time: 2 Hours

The document outlines the details of a mid-semester exam for the course CS719 including: - The exam is open book, notes, and materials - Answers should be brief and directly address the questions - Students may make reasonable assumptions but unreasonable ones may be penalized - Students should not copy others' work or cheat; those who do will fail the exam The exam then provides 4 questions covering topics in logic, proofs, and set theory to be answered within the 2 hour time limit.

Uploaded by

ullasop
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/ 2

CS719 Mid-semester Exam

Max marks: 50 Time: 2 hours

• The exam is open-book, open-notes and open-material-brought-to-exam-hall.

• Be brief, complete and stick to what has been asked. Unnecessarily lengthy solutions may be penalized.

• If you need to make any reasonable assumptions, state them clearly. Unreasonable assumptions run
the risk of attracting penalty.

• If you need to use/cite results covered in class, you may simply cite the result, without going into a
formal proof.

• Do not copy from others or indulge in unfair means.


Students found indulging in such activities will be summarily awarded the FR grade.

1. [5 + 5 marks] Let ϕ be a first-order logic sentence on the vocabulary Σ, and let M be a Σ-structure.
Denote by 2M the Σ-structure defined as follows:

• The universe of 2M is the powerset of the universe of M sans the empty set. In other words,
M M
D2 = 2(D ) \ ∅.
M M
• For every predicate P of arity k > 0 in Σ and for every tuple (S1 , . . . Sk ) ∈ (D2 )k , P 2 (S1 , S2 , . . . Sk ) =
true iff P M (a1 , a2 , . . . ak ) = true for every (a1 , a2 , . . . ak ) ∈ S1 × S2 × · · · Sk .
M
• For every predicate P of arity 0 in Σ, P 2 () = P M ().
M M
• For every function f of arity k > 0 in Σ and for every tuple (S1 , . . . Sk ) ∈ (D2 )k , f 2 (S1 , . . . Sk ) =
{f M (a1 , . . . ak ) | a1 ∈ S1 , . . . ak ∈ Sk }.
M
• For every function f of arity 0 in Σ, f 2 () = f M ().

Either prove or disprove the following statements, assuming Σ does not contain the equality predicate.

(a) If M is a model of ϕ, then so is 2M .


(b) If 2M is a model of ϕ, then so is M .

2. [10 marks] A student has come up with a controversial proof claiming that there exists a largest
natural number. The sketch of the proof proceeds as follows:
Begin proof sketch
Consider a vocabulary Σ consisting of the constants {1, 2, . . .}. In addition, let Σ also contain = and
<. Now consider the following sets of first-order sentences:

• Γ1 = {¬(1 = 2), ¬(1 = 3), . . .}. In other words, all the constants are asserted to be distinct.

1
• Γ2 = {1 < 2, 2 < 3, . . .}. In other words, the successive constants are ordered.
• Γ3 = {∀x ¬(x < x), ∀x∀y∀z ((x < y) ∧ (y < z) → (x < z)), ∀x∀y ((x < y) → ¬(y < x))} In
other words, the < relation is irreflexive, transitive and vacuously anti-symmetric.
• Γ4 = {∃x∀y ((x = y) ∨ (y < x))}. In other words, there exists a largest element in the universe.

Since every finite subset of Γ = Γ1 ∪ Γ2 ∪ Γ3 ∪ Γ4 is satisfiable, by the Compactness Theorem, the


whole of Γ is also satisfiable. Hence there exists a largest natural number.
End proof sketch
Either identify the error in the above proof, or accept the tumultous conclusion that there is a largest
natural number! In the former case, clearly identify the error in the above proof and explain why
the student is in error. In the latter case, identify the largest natural number!

3. [5 + 5 + 5 marks] The spectrum of a first-order logic sentence is the set of cardinalities of all finite
models of the sentence. Thus, if ϕ ≡ ∃x∃y¬(x = y) and ψ ≡ ∃x∀y(x = y), then the spectrum of ϕ
is the set of all natural numbers greater than or equal to 2, while the spectrum of ψ is the singleton
set {1}.
Let P(n) be a predicate on natural numbers that evaluates to true on infinitely many natural numbers.
An example of such a predicate is GreaterThanOrEqualTo2 (n), which evaluates to true iff n ≥ 2.
Now consider a first-order logic sentence ϕ such that its spectrum is exactly the set of natural numbers
n satisfying P(n).

(a) Show that if the signature of ϕ doesn’t contain =, the spectrum of ϕ is co-finite, i.e. there are
only finitely many natural numbers not in the spectrum.
(b) Show that ϕ necessarily has a model with an infinite universe.
(c) Show that if there are infinitely many natural numbers satisfying ¬P(n) as well, then the
signature of ϕ necessarily contains relations/functions other than =.

4. [5 + 5 + 5 marks] Let (P ; ≤) be a partially ordered set. In each subquestion below, either give an
example of (P ; ≤) satisfying the stated property, or indicate why such a partial order cannot exist.

(a) O(P ) and P have the same cardinality, and P has at least two incomparable elements.
(b) For every element p ∈ P , both ↓ p and ↑ p have infinitely many incomparable elements.
(c) Every chain in P is of finite size, every anti-chain in P is of finite size, but P has infinitely many
elements.

You might also like