Permutability of Proofs in Intuitionistic Sequent Calculi
نویسندگان
چکیده
We prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuitionistic propositional logic (based on Kleene’s G3) are inter-permutable (using a set of basic “permutation reduction rules” derived from Kleene’s work in 1952) iff they determine the same natural deduction. The basic rules form a confluent and weakly normalising rewriting system. §
منابع مشابه
Focused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کاملProof Nets for Intuitionistic Logic
Until the beginning of the 20th century, there was no way to reason formally about proofs. In particular, the question of proof equivalence had never been explored. When Hilbert asked in 1920 for an answer to this very question in his famous program, people started looking for proof formalizations. Natural deduction and sequent calculi, which were invented by Gentzen in 1935, quickly became two...
متن کاملThe depth of intuitionistic cut free proofs
We prove a quadratic upper bound for the depth of cut free proofs in propositional intuitionistic logic formalized with Gentzen’s sequent calculus. We discuss bounds on the necessary number of reuses of left implication rules. We exhibit an example showing that this quadratic bound is optimal. As a corollary, this gives a new proof that propositional validity for intuitionistic logic is in PSPACE.
متن کاملStructural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise implementations in Elf, a constraint logic programming language based on the LF logical f...
متن کاملPermutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts
This work presents an extension with cuts of Schwichtenberg’s multiary sequent calculus. We identify a set of permutative conversions on it, prove their termination and confluence and establish the permutability theorem. We present our sequent calculus as the typing system of the generalised multiary λ-calculus λJ, a new calculus introduced in this work. λJ corresponds to an extension of λ-calc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 212 شماره
صفحات -
تاریخ انتشار 1999