Scribd
Upload
22 views5 pages

CS201Assignment1 Sol1

Discrete maths

Uploaded by

abhishekraj0093
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
22 views5 pages

CS201Assignment1 Sol1

Discrete maths

Uploaded by

abhishekraj0093
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/ 5

Solutions to Practice Problems Sheet-1

Q1

(a) Assume that there is a set A = {x | x is a set and x 6∈ x}.


If A ∈ A then by definition of A, A 6∈ A.
If A 6∈ A then again by definition of A, A ∈ A.
Either A ∈ A or A 6∈ A (membership relation is classical) and we have contradiction
in both cases.
Therefore our assumption that there is a set A as above, is untenable.
(Note that this argument holds both in naive set theory or in axiomatic set theory
like ZF.)

(b) Assume that φ is provable in T then by definition of φ, φ is False. As T is sound this


is not possible.
Therefore φ is not provable in T , again by definition of φ, it is True.
So there is a True sentence of T which is not provable in T .
Therefore T is incomplete.

Q2

(a) In minimal logic.

A`A B`B
¬(A ∨ B) ` ¬(A ∨ B) A`A∨B ¬(A ∨ B) ` ¬(A ∨ B) B `A∨B
¬(A ∨ B), A ` ⊥ ¬(A ∨ B), B ` ⊥
¬(A ∨ B) ` ¬A ¬(A ∨ B) ` ¬B
¬(A ∨ B), ¬(A ∨ B) ` ¬A ∧ ¬B
¬(A ∨ B) ` ¬A ∧ ¬B
` ¬(A ∨ B) → ¬A ∧ ¬B

1
(b) In minimal logic.

¬A ∧ ¬B ` ¬A ∧ ¬B ¬A ∧ ¬B ` ¬A ∧ ¬B
¬A ∧ ¬B ` ¬A A`A ¬A ∧ ¬B ` ¬B B`B
A∨B `A∨B ¬A ∧ ¬B, A ` ⊥ ¬A ∧ ¬B, B ` ⊥
¬A ∧ ¬B, A ∨ B ` ⊥
` ¬A ∧ ¬B → ¬(A ∨ B)
(c) In classical logic.
D1 D2
¬(¬A ∨ ¬B) ` A ¬(¬A ∨ ¬B) ` B
¬(¬A ∨ ¬B), ¬(¬A ∨ ¬B) ` A ∧ B
¬(A ∧ B) ` ¬(A ∧ B) ¬(¬A ∨ ¬B) ` A ∧ B
¬(A ∧ B), ¬(¬A ∨ ¬B) ` ⊥
PBC
¬(A ∧ B) ` ¬A ∨ ¬B
` ¬(A ∧ B) → ¬A ∨ ¬B

• where D1 is

¬A ` ¬A
¬(¬A ∨ ¬B) ` ¬(¬A ∨ ¬B) ¬A ` ¬A ∨ ¬B
¬(¬A ∨ ¬B), ¬A ` ⊥
PBC
¬(¬A ∨ ¬B) ` A
(PBC stands for proof by contradiction.)

• and D2 is

¬B ` ¬B
¬(¬A ∨ ¬B) ` ¬(¬A ∨ ¬B) ¬B ` ¬A ∨ ¬B
¬(¬A ∨ ¬B), ¬B ` ⊥
PBC
¬(¬A ∨ ¬B) ` B

(d) In minimal logic.

A∧B `A∧B A∧B `A∧B


¬A ` ¬A A∧B `A ¬B ` ¬B A∧B `B
¬A ∨ ¬B ` ¬A ∨ ¬B A ∧ B, ¬A ` ⊥ A ∧ B, ¬B ` ⊥
¬A ∨ ¬B, A ∧ B ` ⊥
¬A ∨ ¬B ` ¬(A ∧ B)
` ¬A ∨ ¬B → ¬(A ∧ B)

2
(e) In minimal logic.

¬A ` ¬A A`A
A, ¬A ` ⊥
¬¬¬A ` ¬¬¬A A ` ¬¬A
¬¬¬A, A ` ⊥
¬¬¬A ` ¬A
` ¬¬¬A → ¬A
Q3

(a)
D2
D1 ¬B → ¬A ` (¬¬A → ¬¬B)
A → B ` (¬B → ¬A) ` (¬B → ¬A) → (¬¬A → ¬¬B)
(A → B) ` (¬¬A → ¬¬B)
` (A → B) → (¬¬A → ¬¬B)

• where D1 is

A→B`A→B A`A
A → B, A ` B ¬B ` ¬B
A → B, A, ¬B ` ⊥
A → B, ¬B ` ¬A
A → B ` (¬B → ¬A)
• D2 is similar, with A, B replaced by ¬B, ¬A respectively.

(b) Forward implication


D1 D2
¬¬(A ∧ B) ` ¬¬A ¬¬(A ∧ B) ` ¬¬B
¬¬(A ∧ B), ¬¬(A ∧ B) ` ¬¬A ∧ ¬¬B
¬¬(A ∧ B) ` ¬¬A ∧ ¬¬B
` ¬¬(A ∧ B) → ¬¬A ∧ ¬¬B

• where D1 is

A∧B `A∧B axiom


A∧B `A ∧e2
¬A ` ¬(A ∧ B) CPOS
¬¬(A ∧ B) ` ¬¬A CPOS
In which we have used a derived inference rule

3
Γ, A ` B
CPOS [CPOS stands for contra position]
Γ, ¬B ` ¬A
whose derivation is as follows.
Γ, A ` B
¬B ` ¬B
Γ, ¬B, A ` ⊥
Γ, ¬B ` ¬A
• Derivation D2 is similar.

(b) Backward implication,


D1
A, B, ¬(A ∧ B) ` ⊥ ¬¬A ∧ ¬¬B ` ¬¬A ∧ ¬¬B
¬(A ∧ B), B ` ¬A ¬¬A ∧ ¬¬B ` ¬¬A
¬(A ∧ B), B, ¬¬A ∧ ¬¬B ` ⊥ ¬¬A ∧ ¬¬B ` ¬¬A ∧ ¬¬B
¬(A ∧ B), ¬¬A ∧ ¬¬B ` ¬B ¬¬A ∧ ¬¬B ` ¬¬B
¬¬A ∧ ¬¬B, ¬¬A ∧ ¬¬B, ¬(A ∧ B) ` ⊥
¬¬A ∧ ¬¬B, ¬(A ∧ B) ` ⊥
¬¬A ∧ ¬¬B ` ¬¬(A ∧ B)
` ¬¬A ∧ ¬¬B → ¬¬(A ∧ B)

• where D1 is

A`A B`B
A, B ` (A ∧ B) ¬(A ∧ B) ` ¬(A ∧ B)
A, B, ¬(A ∧ B) ` ⊥

4
Q4

(a) Labeling is as follows.


Γ1 ` t1 : A Γ2 ` t2 : B
∧i
Γ1 , Γ2 ` ht1 , t2 i : A ∧ B

Γ`t:A
∨i1
Γ ` inl(t) : A ∨ B

Γ`t:B
∨i2
Γ ` inr(t) : A ∨ B

Γ, x : A ` t : B
→i
Γ ` λx : A.t : A → B

Γ1 ` t : A → B Γ2 ` s : A
→e
Γ1 , Γ2 ` ts : B
(b) Precise meaning of these construction terms is given by the following equations:

1. π1 ht, si = t
2. π2 ht, si = s
3. case inl(v) of inl(a) ⇒ t1 | inr(b) ⇒ t2 = t1 [v/a],
where t1 [v/a] stands for substituting all (free) occurrences a in t1 by v.
4. case inr(v) of inl(a) ⇒ t1 | inr(b) ⇒ t2 = t2 [v/b]

(c) Labeling for structural rules is as follows.


Γ`t:A
1. weakening
Γ, x : B ` t : A

Γ, x : B, y : B ` t : A
2. contraction
Γ, z : B ` t[z/x, z/y] : A

You might also like