Surarso, Bayu (2007) *TEOREMA ELIMINASI CUT PADA SISTEM LOGIKA FLgc DAN FLw,gc.* Jurnal Matematika, 10 (2). pp. 39-42. ISSN 1410-8518

Microsoft Word - Published Version 344Kb |

## Abstract

It is well known that the cut elimination theorem does not hold for FLc dan FLw,c, neither for propositional level nor predicate level. On the other hand, it has been proved that for the propositional level the cut elimination theorem holds for FL with global contraction (FLgc), which is equivalent to FLc. Similar result is also shown for system FL with both weakening and global contraction rule (FLw,gc), which is equivalent to FLw,c. In the present paper we modify and develop the method used to prove the cut elimination for proportional logic FLgc to show that the cut elimination theorem even holds for the predicate logics FLgc dan FLw,gc.

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

Uncontrolled Keywords: | Theorema Elimination Cut, logica Full Lambek (FL), global contraction. |

Subjects: | Q Science > QA Mathematics |

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

ID Code: | 1839 |

Deposited By: | Mr. Matematika Admin |

Deposited On: | 30 Nov 2009 10:29 |

Last Modified: | 30 Nov 2009 10:29 |

Repository Staff Only: item control page