Cut-elimination and a permutation-free sequent calculus for intuitionistic logic.
|
356
|
The formulas-as-types notion of construction
– Howard
- 1980
|
|
223
|
Logic programming with focusing proofs in linear logic
– Andreoli
- 1992
|
|
105
|
Basic Proof Theory
– Troelstra, Schwichtenberg
- 2000
|
|
97
|
A new constructive logic: Classical logic
– Girard
- 1991
|
|
95
|
Contraction-free sequent calculi for intuitionistic logic
– Dyckhoff
- 1992
|
|
68
|
Forum: A multiple-conclusion specification logic
– Miller
- 1996
|
|
48
|
Mathematical Intuitionism: Introduction to Proof Theory
– Dragalin
- 1988
|
|
43
|
A -calculus structure isomorphic to gentzen-style sequent calculus structure
– Herbelin
- 1994
|
|
39
|
The Collected Papers of Gerhard Gentzen
– Gentzen
- 1969
|
|
36
|
A -calculus Structure Isomorphic to Sequent Calculus Structure
– Herbelin
- 1994
|
|
32
|
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
– Dyckhoff, Pinto
- 1998
|
|
25
|
Lkq and lkt: sequent calculi for second order logic based upon dual linear decompositions of classical implication
– Danos, Joinet, et al.
- 1995
|
|
24
|
Permutabilities of inferences in Gentzen’s calculi LK and LJ
– Kleene
- 1952
|
|
20
|
Permutability of proofs in intuitionistic sequent calculi
– Dyckhoff, Pinto
- 1999
|
|
14
|
Normal Forms and Cut-free Proofs as Natural Transformations
– Girard, Scedrov, et al.
- 1991
|
|
11
|
Uniform proofs and natural deductions
– Dyckhoff, Pinto
- 1994
|
|
9
|
Cut elimination and rewriting: termination proofs
– Cichon, Rusinowitch, et al.
- 1996
|
|
9
|
Strong Normalisation Proofs for Cut-Elimination in Gentzen’s Sequent Calculi
– Bittar
- 1996
|
|
6
|
Intercalation Calculus for Intuitionistic Propositional Logic
– Cittadini
- 1992
|
|
6
|
Pfenning & A. Scedrov : Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51
– Miller, Nadathur, et al.
- 1991
|
|
5
|
Interpolation property for bicartesian closed categories
– Cubric
- 1994
|
|
4
|
A.: "Meta-theory of sequent calculus and natural deduction systems in Coq
– Adams
- 1996
|
|
3
|
Gentzen cut elimination for propositional sequent calculus by rewriting derivations, preprint Laboratoire de Logique, d'Algorithmique et d'Informatique de Clermont 1, N o
– Bittar, E
- 1992
|
|
2
|
Assumption classes in natural deduction", Zeitschrift fr math. Logik 25
– Leivant
- 1979
|
|
2
|
Notes on deductive systems
– Pfenning
- 1994
|
|
2
|
Natural deduction", Almquist
– Prawitz
- 1965
|
|
2
|
Mechanisms and search
– Sieg
- 1992
|
|
2
|
Dalen: "Constructivism in mathematics: an introduction (vol 2
– Troelstra, van
- 1988
|
|
1
|
Orderings for term-rewriting systems", Theoretical Computer Science 17
– Dershowitz
- 1982
|
|
