BibTex Citation Data :
@article{JM1313, author = {Bayu surarso}, title = {TEOREMAINTERPOLASI UNTUK LOGIKA PREDIKAT SUBSTRUKTUR DENGAN ATURAN MINGLE}, journal = {MATEMATIKA}, volume = {13}, number = {2}, year = {2012}, keywords = {}, abstract = { It is known that the interpolation theorem for Full Lambek Substructural Logic and its standard extensions can be proved using proof-theoretical methods. In fact, they can be proved by a well known method called Maehara’s method, or its modifications. In the present paper, by proving the cut elimination theorem and then using a modification of Maehara’s method, we prove the interpolation problem for logics obtaining from some standard extensions of Full Lambek Logic by adding rule called mingle. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/1313} }
Refworks Citation Data :
It is known that the interpolation theorem for Full Lambek Substructural Logic and its standard extensions can be proved using proof-theoretical methods. In fact, they can be proved by a well known method called Maehara’s method, or its modifications. In the present paper, by proving the cut elimination theorem and then using a modification of Maehara’s method, we prove the interpolation problem for logics obtaining from some standard extensions of Full Lambek Logic by adding rule called mingle.
Last update:
Last update: 2024-11-25 09:38:23