INTERPOLATION BY TRANSLATION
This chapter proposes some uniform algorithmic methodology for finding interpolants in various logic. It operates with translations of non-classical logics into classical first-order theories and introduces so-called expansion interpolation. This leads us to find interpolants in the classical theories using the existing algorithms, which can then be translated back into non-classical theories. Two examples from modal logic are considered: quantified S5 and propositional S4.3. These logic lack ordinary interpolation but have expansion interpolation.
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.
If you think you should have access to this title, please contact your librarian.