Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic (1998)

by Roy Dyckhoff , Luis Pinto
Citations:40 - 6 self

Documents Related by Co-Citation

68 A lambda-calculus structure isomorphic to Gentzen-style sequent calculus structure – Hugo Herbelin
23 Permutability of Proofs in Intuitionistic Sequent Calculi – Roy Dyckhoff, Luís Pinto - 1996
225 Natural Deduction, A Proof-Theoretical Study. Almqvist and Wiskell – Dag Prawitz - 1965
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
131 Contraction-free sequent calculi for intuitionistic logic – R Dyckhoff - 1992
33 A λ-calculus structure isomorphic to sequent calculus structure,Computer science logic – Hugo Herbelin - 1997
102 A New Deconstructive Logic: Linear Logic – Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx - 1995
164 A new constructive logic: Classical logic – J-Y Girard - 1991
333 Logic Programming with Focusing Proofs in Linear Logic – Jean-marc Andreoli - 1992
565 Untersuchungen über das logische Schließen – G Gentzen - 1935
19 Termination of permutative conversions in intuitionistic Gentzen calculi – Helmut Schwichtenberg - 1997
61 Constructive Logics. Part I: A Tutorial on Proof Systems and Typed λ-Calculi – Jean Gallier - 1992
24 Normal forms for sequent derivations – Grigori Mints - 1996
445 The formulae-as-types notion of construction – W A Howard - 1980
30 Normalization as a homomorphic image of cut-elimination – Garrel Pottinger - 1977
12 Revisiting the correspondence between cut elimination and normalisation – J Espírito Santo - 2000
9 Strong normalization of Herbelin’s explicit substitution calculi with substitution propagation, JLC – RD, Urban - 2003
262 Investigations into logical deduction – G Gentzen - 1969
35 LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication – Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx