INTERPOLATION IN GOAL- DIRECTED PROOF SYSTEMS
This chapter studies the interpolation properties for implicational fragment of a variety of substructural, strict modal, and intuitionistic and intermediate logics. The methodology is proof-theoretical and uses a goal directed formulation of these fragments which follows the logic programming style of deduction. More refined as well as new kinds of interpolation theorems are obtained, and new global methods for obtaining interpolation are investigated.
Keywords: linear implication, intuitionistic implication, Lambek calculus, chain interpolation, Beth definability
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .