Scribd
Upload
4 views4 pages

Assign 1

This document is an assignment for the course COL703: Logic for Computer Science, due on September 1, 2024. It includes questions on propositional logic, specifically regarding a custom book number format (MySBN-5), the completeness of logical connectives, and the soundness of an extended logical system. Students are required to answer all questions in designated boxes and adhere to the Honour Code of IIT Delhi.

Uploaded by

hbot07
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
4 views4 pages

Assign 1

This document is an assignment for the course COL703: Logic for Computer Science, due on September 1, 2024. It includes questions on propositional logic, specifically regarding a custom book number format (MySBN-5), the completeness of logical connectives, and the soundness of an extended logical system. Students are required to answer all questions in designated boxes and adhere to the Honour Code of IIT Delhi.

Uploaded by

hbot07
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/ 4

NAME: ENTRY NUMBER:

COL703: Logic for Computer Science


Assignment 1 Due: 2359 hrs, 1st September, 2024

Answer all questions only in the boxes provided; do rough work elsewhere. Solutions outside the assigned box will not be graded.
Attestation: I agree to abide by the Honour Code of IIT Delhi.

Signature:

Q1. The International Standard Book Number (ISBN) is a numeric book identifier. The ISBN-10 format is a ten-character string
which can be checked for correctness according to a preset formula. We have designed our own similar book number format.
The MySBN-5 format consists of five characters, the first four of which are digits from 0 through 4, and the last is a digit
from 0 through 5. A MySBN of the form d0 d1 d2 d3 d4 is correct iff the following equation holds.

d0 ∗ 5 + d1 ∗ 4 + d2 ∗ 3 + d3 ∗ 2 + d4 ∗ 1 ≡ 0 mod 6

Use propositional logic to capture the behaviour of the MySBN format. Use atomic propositions pij to indicate that i appears
in the jth place in a given MySBN. You can use the connectives ∧, ∨, ⊃, and ¬ for the following.

(a) Write out the set of atomic propositions.

(b) Write a propositional logic expression φ which represents the MySBN 12340.

(c) Write a propositional logic expression ψ which represents the MySBN 22224.

(d) Write a propositional expression χ which is true exactly of those MySBNs which are correct.

1
(e) Use φ and χ to prove that 12340 is a correct MySBN.

(f ) Use ψ and χ to prove that 22224 is not a correct MySBN.

Q2. Prove that the set of connectives {⊃, ¬} is functionally complete for PL.

2
Q3. Recall system H with its three axioms, and the MP and DT inference rules. In general, it is more intuitive for humans to
read proofs over ∧ and ∨. We extend it with the following axioms to get system H + .

(∨l) (φ ∨ ψ) ⊃ (¬φ ⊃ β) (∨r) (¬φ ⊃ β) ⊃ (φ ∨ ψ)


(∧l) (φ ∧ ψ) ⊃ ¬(α ⊃ ¬β) (∧r) ¬(α ⊃ ¬β) ⊃ (φ ∧ ψ)
(a) Show that system H + is sound.

(b) Prove that α ∨ β, α ⊃ γ, β ⊃ γ `H + γ for any α, β, γ PL.

3
Q4. We wish to model systems in a logic, with a view to proving correct operation. If/when failures occur, one is interested in
providing feedback so the system can be fixed. In large systems, this involves isolating the failure and assigning blame to
some particular subsystem. One might wish to code up sentences of the form “If system φ fails, then either ψ1 or ψ2 or ψ3
or . . . ψn must have failed”. However, the basic building blocks always talk about correct operation as the default.

(a) Write the above sentence as an expression in propositional logic.

(b) Show that one can convert any expression of this form to an equivalent clause – a sequence of literals (atoms or negated
atoms) punctuated by ∨.

(c) We will call such clauses “cornuculpa clauses”. Is the resolution procedure provided in class still sound and complete if
we only operate over CNF formulas involving cornuculpa clauses? Describe why if yes, or specify what modifications one
needs to make if not.

(d) How many steps does your algorithm take, if the CNF set has n cornuculpa clauses involving m literals each? Provide a
rigorous (if informal) analysis like the one done in class.

You might also like