Switch to: Citations

Add references

You must login to add references.
  1. Non-axiomatizable second order intuitionistic propositional logic.D. Skvortsov - 1997 - Annals of Pure and Applied Logic 86 (1):33-46.
    The second order intuitionistic propositional logic characterized by the class of all “principal” Kripke frames is non-recursively axiomatizable, as well as any logic of a class of principal Kripke frames containing every finite frame.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic.P. Miglioli, U. Moscato & M. Ornaghi - 1997 - Logic Journal of the IGPL 5 (1):145-167.
    Both at the propositional and the predicate level, in tableau systems of intuitionistic logic as well as in the corresponding sequent and natural calculi, the problem arises of reducing as much as possible the duplication of formulas, i.e., the reuse of formulas already used in a proof, in order to single out efficient proof search techniques. This problem has been analyzed in a paper by Dyckhoff, where a nearly optimal solution is given for intuitionistic propositional sequent and natural calculi, and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the complexity of propositional quantification in intuitionistic logic.Philip Kremer - 1997 - Journal of Symbolic Logic 62 (2):529-544.
    We define a propositionally quantified intuitionistic logic Hπ + by a natural extension of Kripke's semantics for propositional intutionistic logic. We then show that Hπ+ is recursively isomorphic to full second order classical logic. Hπ+ is the intuitionistic analogue of the modal systems S5π +, S4π +, S4.2π +, K4π +, Tπ +, Kπ + and Bπ +, studied by Fine.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • On 2nd order intuitionistic propositional calculus with full comprehension.Dov M. Gabbay - 1974 - Archive for Mathematical Logic 16 (3-4):177-186.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   20 citations  
  • On the Complexity of Propositional Quantification in Intuitionistic Logic.Philip Kremer - 1997 - Journal of Symbolic Logic 62 (2):529-544.
    We define a propositionally quantified intuitionistic logic $\mathbf{H}\pi +$ by a natural extension of Kripke's semantics for propositional intutionistic logic. We then show that $\mathbf{H}\pi+$ is recursively isomorphic to full second order classical logic. $\mathbf{H}\pi+$ is the intuitionistic analogue of the modal systems $\mathbf{S}5\pi +, \mathbf{S}4\pi +, \mathbf{S}4.2\pi +, \mathbf{K}4\pi +, \mathbf{T}\pi +, \mathbf{K}\pi +$ and $\mathbf{B}\pi +$, studied by Fine.
     
    Export citation  
     
    Bookmark   10 citations