NII Technical Report (NII-2005-003E)

Title Computing Interpolants in Implicational Logics
Authors Makoto Kanazawa
Abstract 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'.
Language English
Published Feb 23, 2005
Pages 91p

NII Technical Reports
National Institute of Informatics