Surarso, Bayu (2007) *PROBLEM ELIMINASI CUT PADA LOGIKA LBB’Ink.* Jurnal Matematika , 10 (3). pp. 86-90. ISSN 1410-8518

Microsoft Word 193Kb |

## Abstract

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 (nk) 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.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Teorema eliminasi cut, LBB’I, aturan (nk). |

Subjects: | Q Science > Q Science (General) |

Divisions: | Faculty of Science and Mathematics > Department of Mathematics |

ID Code: | 1875 |

Deposited By: | INVALID USER |

Deposited On: | 30 Nov 2009 09:46 |

Last Modified: | 30 Nov 2009 09:46 |

Repository Staff Only: item control page