Sciweavers

APAL
2006

Computing interpolants in implicational logics

13 years 3 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz's, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a `strongest' interpolant under a certain restricted but reasonable notion of what counts as an `interpolant'.
Makoto Kanazawa
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where APAL
Authors Makoto Kanazawa
Comments (0)