S., Nada (2010) *TEOREMA ELIMINASI CUT DAN TEOREMA INTERPOLASI UNTUK LOGIKA PREDIKAT FLe,c,n-mingle.* Undergraduate thesis, Faculty of Mathematics and Natural science.

| PDF 44Kb |

## Abstract

In this final assignment, the proving of cut elimination theorem and interpolation theorem for the FL predicate logic expanded by adding the exchange rule, contraction rule, and n-mingle rule, called as the FL e,c,n-mingle predicate logic, is studied. The n-mingle rule is a special inference rule, unlike other rules that have only one or two upper sequent, however, in the n-mingle rule, it is possible to have upper sequent as many as ‘n’. First it is proven that the cut elimination theorem is valid for the FLe,c,n-mingle predicate logic. Then, by using that theorem, it is proven that the interpolation theorem is valid for the FLe,c,n-mingle predicate logic.

Item Type: | Thesis (Undergraduate) |
---|---|

Subjects: | Q Science > QA Mathematics |

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

ID Code: | 19913 |

Deposited By: | INVALID USER |

Deposited On: | 10 Aug 2010 08:43 |

Last Modified: | 10 Aug 2010 08:43 |

Repository Staff Only: item control page