25.04.2013 Views

On Intuitionistic Linear Logic - Microsoft Research

On Intuitionistic Linear Logic - Microsoft Research

On Intuitionistic Linear Logic - Microsoft Research

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

§1. Sequent Calculus 21<br />

(p) Contraction.<br />

Π1<br />

Γ − A<br />

π2<br />

A n , !B, !B, ∆ − C Contraction<br />

A n , !B, ∆ − C Cutn<br />

Γ n , !B, ∆ − C<br />

Let Π ′ be the proof obtained by applying the induction hypothesis to the proof<br />

Π1<br />

Γ − A<br />

π2<br />

A n , !B, !B, ∆ − C Cutn.<br />

Γ n , !B, !B, ∆ − C<br />

We have by assumption that c(Π1), c(π2) ≤ |A| and hence c(Π ′ ) ≤ |A|. We can form the<br />

proof, Π,<br />

Π ′<br />

By definition c(Π) ≤ |A| and we are done.<br />

(q) Promotion.<br />

Π1<br />

!Γ − !A<br />

Γ n , !B, !B, ∆ − C Contraction.<br />

Γ n , !B, ∆ − C<br />

π2<br />

!A n , !∆ − B Promotion<br />

!A n , !∆ − !B Cutn<br />

!Γ n , !∆ − !B<br />

Let Π ′ be the proof obtained by applying the induction hypothesis to the proof<br />

Π1<br />

!Γ − !A<br />

!Γ n , !∆ − B<br />

π2<br />

!A n , !∆ − B Cutn.<br />

We have by assumption that c(Π1), c(π2) ≤ |!A| and hence c(Π ′ ) ≤ |!A|. We can form<br />

the proof, Π,<br />

Π ′<br />

By definition c(Π) ≤ |!A| and we are done.<br />

!Γ n , !∆ − B Promotion.<br />

!Γ n , !∆ − !B<br />

3. When either Π1 or Π2 is an instance of the Identity rule. Firstly<br />

which is replaced by<br />

And similarly the proof<br />

Π1<br />

Γ − A<br />

Γ − A<br />

Identity<br />

A − A Cut,<br />

Π1<br />

Γ − A.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!