Assignment 11

Introduction to Computational Logic, SS 2015

E R SIT
A

UN

IV

S
IS

Prof. Dr. Gert Smolka, Tobias Tebbi

SA

A VIE N

https://courses.ps.uni-saarland.de/icl_15/

Read Chapter 10 of the lecture notes.

Do all the proofs on this sheet on paper as well as in Coq.

Exercise 11.1 Prove the following with diagrams on paper and with Coq. You
may use the following admissible rules.
Weak
a) s ` t

B`s

A `C s

IC

A ` s

A`s
A `C s

A`t

A`s

c) A ` s

AB

A`s

b) s, t ` u

A`s

A`t

A`u

A `s

d) s ` s
e) s `C s
f) A `C s

A, s `C

g) A ` s t

A, s ` t

h) A ` s t

(A0 .

A A0

A0 ` s

A0 ` t)

i) `
Exercise 11.2 Prove that A ` s A `C s.
Exercise 11.3 Prove weakening for classical ND.
A `C s
B `C s

AB

Exercise 11.4 Prove that the refutation lemma (A ` A `C ) is equivalent to

Glivenkos theorem.
Exercise 11.5 Prove the following variant of Glivenkos theorem by induction.
A `C s A, s `
Exercise 11.6 Prove that the following rules are admissible using a diagram and
in Coq.
A`s

s`t

A `C s
A `C u

A`t

suA

Exercise 11.7 Let A be a context. Use Glivenkos Theorem to prove there is no

formula s such that A `C s and A 6` s.

20150710

00:56

Recall the Hilbert system for intuitionistic propositional logic

K

Hs t s

H (s t u) (s t) s u

MP

Hs t

H u

Hs

Ht

and its variant with assumptions

C

A `H s

sA

A `H s t s

A `H (s t u) (s t) s u
A `H s t

MP

A `H u

A `H s

A `H t

Exercise 11.8 Prove H (s s) as a diagram on paper and in Coq. Hint: SKK.

Exercise 11.9 Prove
A`s

A `H s

assuming
D : A, s, t.

A, s `H t

A `H s t

Exercise 11.10 Prove the following form of weakening for the Hilbert calculus.
A `H t

A, s `H t

Exercise 11.11 (Substitutivity)

Define a substitution function subst : (var form) form form such that
subst s is s where every variable x is replaced by x. We write s for subst s.
Prove the following.
A`s
Substitutivity
A`s
Exercise 11.12 Consider formulas s, t ::= x | s t and define A `D s such that
A `D s t

A, s `D u

u.

A, t `D u

A `D u

a) Define `D with the context rule, two introduction rules for , and one elimination rule for .
b) Prove the characteristic equivalence for given above.
c) Profe that `D satisfies weakening.
Exercise 11.13 (Challenge) In this exercise, we show that the following attempt
to formulate a characteristic property for implication is wrong.
A`st

(A ` s

A ` t)

That is, prove that

A s t.

A`st

(A ` s

A ` t)

You may assume that for every variable x, we have 6` x and 6` x, that is, neither
x nor its negation are provable.

20150710

00:56