Switch to: References

Add citations

You must login to add citations.
  1. Computing Interpolants in Implicational Logics.Makoto Kanazawa - 2006 - Annals of Pure and Applied Logic 142 (1):125-201.
    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’.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Connection Between Cut Elimination and Normalization.Mirjana Borisavljević - 2006 - Archive for Mathematical Logic 45 (2):113-148.
    A new set of conversions for derivations in the system of sequents for intuitionistic predicate logic will be defined. These conversions will be some modifications of Zucker's conversions from the system of sequents from [11], which will have the following characteristics: (1) these conversions will be sufficient for transforming a derivation into a cut-free one, and (2) in the natural deduction the image of each of these conversions will be either in the set of conversions for normalization procedure, or an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations