PROBLEM ELIMINASI CUT PADA LOGIKA LBBâInk
| Main Author: | Surarso, Bayu |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
JURUSAN MATEMATIKA FMIPA
, 2007
|
| Subjects: | |
| Online Access: |
http://eprints.undip.ac.id/1866/1/3.bayu_s__baru_.pdf http://eprints.undip.ac.id/1866/ |
Daftar Isi:
- In the present paper we study the problem of the cut elimination in logics LBBâInk , i.e. logics obtained from LBBâI by adding a rule called (nï®k) rule. It is known that the cut elimination theorem for LBBâI and its standard extensions can be proved using some modifications of the method used by Gentzen in 1935 to prove the cut elimination theorem for Intuitionistic Logic. We extend the modifications to show that LBBâInk enjoy the cut elimination theorem when k=1. On the other side, we give a counter example sequent to show that the cut elimination theorem does not work for LBBâInk when k>1.