Reduction Rules for Intuitionistic \({{\lambda}{\rho}}\) -calculus

Abstract The third author gave a natural deduction style proof system called the \({{\lambda}{\rho}}\)-calculus for implicational fragment of classical logic in (Komori, Tsukuba J Math 37:307–320, 2013). In (Matsuda, Intuitionistic fragment of the \({{\lambda}{\mu}}\)-calculus, 2015, Post-proceedings of the RIMS Workshop “Proof Theory, Computability Theory and Related Issues”, to appear), the fourth author gave a natural subsystem “intuitionistic \({{\lambda}{\rho}}\)-calculus” of the \({{\lambda}{\rho}}\)-calculus, and showed the system corresponds to intuitionistic logic. The proof is given with tree sequent calculus (Kripke models), but is complicated. In this paper, we introduce some reduction rules for the \({{\lambda}{\rho}}\)-calculus, and give a simple and purely syntactical proof to the theorem by use of the reduction. In addition, we show that we can give a computation model with rich expressive power with our system.