kw.\*:("ELIMINATION COUPURE")
Results 1 to 25 of 58
Selection :
BORNES FONCTORIELLES POUR L'ELIMINATION DES COUPURES = FUNCTORIAL BOUNDS FOR THE ELIMINATION OF CUTSZANDA FERBUS MARIE CHRISTINE.1982; ; FRA; DA. 1982; 74 F; 30 CM; BIBL. 1 P.; TH. 3E CYCLE: MATH./PARIS 7/1982Thesis
Atomic cut elimination for classical logicBRÜNNLER, Kai.Lecture notes in computer science. 2003, pp 86-97, issn 0302-9743, isbn 3-540-40801-0, 12 p.Conference Paper
Unwinding a non-effective cut elimination proofMINTS, Grigori.Lecture notes in computer science. 2006, pp 259-269, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 11 p.Conference Paper
Formalised cut admissibility for display logicDAWSON, Jeremy E; GORE, Rajeev.Lecture notes in computer science. 2002, pp 131-147, issn 0302-9743, isbn 3-540-44039-9, 17 p.Conference Paper
Strong normalisation for a Gentzen-like cut-elimination procedureURBAN, Christian.Lecture notes in computer science. 2001, pp 415-429, issn 0302-9743, isbn 3-540-41960-8Conference Paper
Canonical gentzen-type calculi with (n,k)-ary quantifiersZAMANSKY, Anna; AVRON, Arnon.Lecture notes in computer science. 2006, pp 251-265, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 15 p.Conference Paper
A cut-free sequent calculus for Pure Type Systems verifying the structural rules of Gentzen/KleeneGUTIERREZ, Francisco; RUIZ, Blas.Lecture notes in computer science. 2003, pp 17-31, issn 0302-9743, isbn 3-540-40438-4, 15 p.Conference Paper
On constructive existencePARIGOT, Michel.Lecture notes in computer science. 2006, pp 268-273, issn 0302-9743, isbn 3-540-31428-8, 1Vol, 6 p.Conference Paper
Resolution refutations and propositional proofs with height-restrictionsBECKMANN, Arnold.Lecture notes in computer science. 2002, pp 599-612, issn 0302-9743, isbn 3-540-44240-5, 14 p.Conference Paper
Analogy calculusBO YI; JIAFU XU.Theoretical computer science. 1993, Vol 113, Num 2, pp 211-230, issn 0304-3975Article
Linear logic, coherence and dinaturalityBLUTE, R.Theoretical computer science. 1993, Vol 115, Num 1, pp 3-41, issn 0304-3975Conference Paper
CERES in many-valued logicsBAAZ, Matthias; LEITSCH, Alexander.Lecture notes in computer science. 2005, pp 1-20, issn 0302-9743, isbn 3-540-25236-3, 20 p.Conference Paper
Structures for multiplicative cyclic linear logic: Deepness vs cyclicityDI GIANANTONIO, Pietro.Lecture notes in computer science. 2004, pp 130-144, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper
Proofnets and context semantics for the additivesMAIRSON, Harry G; RIVAL, Xavier.Lecture notes in computer science. 2002, pp 151-166, issn 0302-9743, isbn 3-540-44240-5, 16 p.Conference Paper
Confluence as a cut elimination propertyDOWEK, Gilles.Lecture notes in computer science. 2003, pp 2-13, issn 0302-9743, isbn 3-540-40254-3, 12 p.Conference Paper
Stratification and cut-eliminationCRABBE, M.The Journal of symbolic logic. 1991, Vol 56, Num 1, pp 213-226, issn 0022-4812Article
Structure of proofs and the complexity of cut eliminationWENHUI ZHANG.Theoretical computer science. 2006, Vol 353, Num 1-3, pp 63-70, issn 0304-3975, 8 p.Article
On a local-step cut-elimination procedure for the intuitionistic sequent calculusKIKUCHI, Kentaro.Lecture notes in computer science. 2006, pp 120-134, issn 0302-9743, isbn 3-540-48281-4, 1Vol, 15 p.Conference Paper
Structural proof theory as rewritingESPFRITO SANTO, J; FRADE, M. J; PINTO, L et al.Lecture notes in computer science. 2006, pp 197-211, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 15 p.Conference Paper
Permutative logicANDREOLI, Jean-Marc; PULCINI, Gabriele; RUET, Paul et al.Lecture notes in computer science. 2005, pp 184-199, issn 0302-9743, isbn 3-540-28231-9, 16 p.Conference Paper
A sequent calculus for nominal logicGABBAY, Murdoch; CHENEY, James.Symposium on Logic in Computer Science. 2004, pp 139-148, isbn 0-7695-2192-4, 1Vol, 10 p.Conference Paper
Cut-elimination for a logic with definitions and inductionMCDOWELL, R; MILLER, D.Theoretical computer science. 2000, Vol 232, Num 1-2, pp 91-119, issn 0304-3975Article
The heart of intersection type assignment : Normalisation proofs revisitedVAN BAKEL, Steffen.Theoretical computer science. 2008, Vol 398, Num 1-3, pp 82-94, issn 0304-3975, 13 p.Article
A proof theoretical account of continuation passing styleOGATA, Ichiro.Lecture notes in computer science. 2002, pp 490-505, issn 0302-9743, isbn 3-540-44240-5, 16 p.Conference Paper
New foundations for the geometry of interactionABRAMSKY, S; JAGADEESAN, R.Information and computation (Print). 1994, Vol 111, Num 1, pp 53-199, issn 0890-5401Article