Abstract
This paper present a new sequent calculus for Pure Type Systems (PTS). The calculus proposed is equiconsistent to the standard formulation (natural deduction like). The corresponding cut-free fragment makes it possible to introduce a notion of Cut Elimination. This property can be applied to develop proof-search strategies with dependent types.We prove that Cut Elimination holds in two important families of normalizing systems, including, in particular, three systems in the Barendregt's λ-cube: λ →, λ2, and λ ω . In addition, a cut elimination result is obtained for the minimal implicational second-order sequent calculus.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
