Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
95 | Olivier Hermant |
Semantic Cut Elimination in the Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 221-233, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
intuitionistic sequent calculus, cut admissibility, cut elimination property, semantic, Kripke Structure, deduction modulo |
89 | Kai Brünnler |
Atomic Cut Elimination for classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 86-97, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
atomic cut, sequent calculus, cut elimination, natural deduction, classical logic |
85 | Christian Urban |
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings., pp. 415-430, 2001, Springer, 3-540-41960-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Recursive Path Ordering, Cut-Elimination, Explicit Substitution, Classical Logic |
83 | Agata Ciabattoni, Kazushige Terui |
Modular Cut-Elimination: Finding Proofs or Counterexamples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 135-149, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
79 | Francisco Gutiérrez, Blas C. Ruiz |
Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 956-968, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
pure type systems, expansion postponement, Track: B, cut elimination, sequent calculi |
75 | Kentaro Kikuchi |
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 398-407, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
?-calculus, Sequent calculus, Cut-elimination, Confluence, Explicit substitution |
69 | Kai Brünnler |
Cut Elimination inside a Deep Inference System for Classical Predicate Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 51-71, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
cut elimination, first-order predicate logic, deep inference |
68 | Francesco Belardinelli, Peter Jipsen, Hiroakira Ono |
Algebraic Aspects of Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 77(2), pp. 209-240, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Algebraic Gentzen systems, finite model property, residuated lattices, cut elimination, substructural logics |
67 | José Espírito Santo |
Revisiting the Correspondence between Cut Elimination and Normalisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 600-611, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
62 | Harry G. Mairson, Kazushige Terui |
On the Computational Complexity of Cut-Elimination in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 23-36, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
58 | Hugo Herbelin, Gyesik Lee |
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 209-217, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intuitionistic Gentzen-style sequent calculus, completeness, cut-elimination, Kripke semantics |
58 | Guillaume Burel, Claude Kirchner |
Cut Elimination in Deduction Modulo by Abstract Completion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 115-131, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Knuth-Bendix completion, automated deduction and interactive theorem proving, proof ordering, abstract canonical system, cut elimination, deduction modulo |
57 | Clément Houtmann |
Axiom Directed Focusing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers, pp. 169-185, 2008, Springer, 978-3-642-02443-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
superdeduction, Proof theory, focusing, deduction modulo |
57 | Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr |
Cut-Elimination: Experiments with CERES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, pp. 481-495, 2004, Springer, 3-540-25236-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
56 | Dirk Pattinson, Lutz Schröder |
Generic Modal Cut Elimination Applied to Conditional Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings, pp. 280-294, 2009, Springer, 978-3-642-02715-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Gilles Dowek, Olivier Hermant |
A Simple Proof That Super-Consistency Implies Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 93-106, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Philipp Gerhardy |
Refined Complexity Analysis of Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 212-225, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
56 | Christian Urban, Gavin M. Bierman |
Strong Normalisation of Cut-Elimination in Classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings, pp. 365-380, 1999, Springer, 3-540-65763-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
55 | Grigori Mints |
Unwinding a Non-effective Cut Elimination Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 259-269, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Olivier Laurent 0001, Roberto Maieli |
Cut Elimination for Monomial MALL Proof Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 486-497, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Linear Logic, Cut Elimination, Proof Net |
53 | Agata Ciabattoni, Kazushige Terui |
Towards a Semantic Characterization of Cut-Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 95-119, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
nonclassical logicss, phase semantics, sequent calculus, cut-elimination, substructural logics |
53 | Anna Zamansky, Arnon Avron |
Cut-Elimination and Quantification in Canonical Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 157-176, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
canonical systems, proof theory, cut elimination, non-deterministic matrices |
53 | Grigori Mints |
Cut Elimination for S4C: A Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 121-132, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Dynamic topological logic, cut elimination |
53 | Torben Braüner, Valeria de Paiva |
A Formulation of Linear Logic Based on Dependency-Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers, pp. 129-148, 1997, Springer, 3-540-64570-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
52 | Koji Nakazawa |
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 336-350, 2007, Springer, 978-3-540-73227-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Arnon Avron, Anna Zamansky |
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 31-45, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Kentaro Kikuchi |
On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 120-134, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Ichiro Ogata |
Cut Elimination for Classical Proofs as Continuation Passing Style Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN '98, 4th Asian Computing Science Conference, Manila, The Philippines, December 8-10, 1998, Proceedings, pp. 61-78, 1998, Springer, 3-540-65388-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
50 | Matthias Baaz, Agata Ciabattoni |
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings, pp. 24-37, 2002, Springer, 3-540-43929-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Francisco Gutiérrez, Blas C. Ruiz |
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Tranformation, 12th International Workshop, LOPSTR 2002, Madrid, Spain, September 17-20,2002, Revised Selected Papers, pp. 17-31, 2002, Springer, 3-540-40438-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
lambda calculus with types, pure type systems, cut elimination, sequent calculi |
48 | Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr |
Proof Transformation by CERES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MKM ![In: Mathematical Knowledge Management, 5th International Conference, MKM 2006, Wokingham, UK, August 11-12, 2006, Proceedings, pp. 82-93, 2006, Springer, 3-540-37104-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Michele Pagani |
The Cut-Elimination Theorem for Differential Nets with Promotion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, pp. 219-233, 2009, Springer, 978-3-642-02272-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Kentaro Kikuchi, Stéphane Lengrand |
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 380-394, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Olivier Hermant, James Lipton |
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 169-183, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Chiyan Chen, Dengping Zhu, Hongwei Xi |
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 6th International Symposium, PADL 2004, Dallas, TX, USA, June 18-19, 2004, Proceedings, pp. 239-254, 2004, Springer, 3-540-22253-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | James Laird |
A Deconstruction of Non-deterministic Classical Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings., pp. 268-282, 2001, Springer, 3-540-41960-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Claudia Faggian |
Classical Proofs via Basic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers, pp. 203-219, 1997, Springer, 3-540-64570-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
41 | Arnon Avron, Anna Zamansky |
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 52-63, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Norihiro Kamide |
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLIMA ![In: Computational Logic in Multi-Agent Systems, 9th International Workshop, CLIMA IX, Dresden, Germany, September 29-30, 2008. Revised Selected and Invited Papers, pp. 57-76, 2008, Springer, 978-3-642-02733-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Gilles Dowek |
Confluence as a Cut Elimination Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 2-13, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Birgit Elbl |
Cut elimination for a calculus with context-dependent rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 40(3), pp. 167-188, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03F05, 03B60, 68N17, 68Q55 |
41 | Matthias Baaz, Alexander Leitsch |
Comparing the Complexity of Cut-Elimination Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 49-67, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Roy Dyckhoff, Delia Kesner, Stéphane Lengrand |
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 347-361, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Arnold Beckmann |
Resolution Refutations and Propositional Proofs with Height-Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 599-612, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus |
37 | José Espírito Santo |
The lambda-Calculus and the Unity of Structural Proof Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 963-994, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Mirjana Borisavljevic |
A Connection Between Cut Elimination and Normalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(2), pp. 113-148, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Norihiro Kamide |
Proof Systems Combining Classical and Paraconsistent Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 91(2), pp. 217-238, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Paraconsistent negation, completeness, sequent calculus, cut-elimination |
34 | Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui |
From Axioms to Analytic Rules in Nonclassical Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 229-240, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
nonclassical logics, hypersequent calculi, semantic cut-elimination, sequent calculi |
34 | Alessio Guglielmi |
A system of interaction and structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(1), pp. 1, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
mix rule, noncommutativity, pomset logic, symmetry, linear logic, cut elimination, self-duality, deep inference, Calculus of structures |
34 | Aleksandra Kislak-Malinowska |
On the Logic of beta -pregroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 87(2-3), pp. 323-342, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
?-pregroup, normalization theorem, cut elimination, Pregroup |
34 | Annie Foret |
Pregroup Calculus as a Logic Functor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings, pp. 147-161, 2007, Springer, 978-3-540-73443-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Lambek Categorial Grammars, Logic Functor, Cut Elimination, Pregroups |
34 | Matthias Baaz, Rosalie Iemhoff |
Gentzen Calculi for the Existence Predicate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 7-23, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
existence predicate, Gentzen calculus, truth-value logics, Gödel logics, Scott logics, cut-elimination, Intuitionistic logic, Kripke models, Skolemization |
34 | Henry Towsner |
Epsilon substitution for transfinite induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(4), pp. 397-412, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Epsilon substitution, Cut elimination |
34 | Matthias Baaz, Rosalie Iemhoff |
On Interpolation in Existence Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 697-711, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
existence predicate, Gentzen calculus, Beth definability, truth-value logics, Gödel logics, Scott logics, interpolation, cut-elimination, Intuitionistic logic, Kripke models, Skolemization |
34 | Stefano Baratella, Andrea Masini |
An approach to infinitary temporal proof theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(8), pp. 965-990, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Modal logic, Proof theory, Sequent calculus, Cut elimination, Infinitary logic |
32 | Agata Ciabattoni, George Metcalfe |
Density Elimination and Rational Completeness for First-Order Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 132-146, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Matthias Baaz, Alexander Leitsch |
CERES in Many-Valued Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, pp. 1-20, 2004, Springer, 3-540-25236-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Alessio Guglielmi, Lutz Straßburger |
Non-commutativity and MELL in the Calculus of Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 54-68, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Michel Parigot |
Free Deduction: An Analysis of "Computations" in Classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RCLP ![In: Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990 - Second Russian Conference on Logic Programming, St. Petersburg, Russia, September 11-16, 1991, Proceedings, pp. 361-380, 1991, Springer, 3-540-55460-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
31 | Rajeev Goré, Linda Postniece, Alwen Tiu |
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings, pp. 189-204, 2009, Springer, 978-3-642-02715-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Mirjana Borisavljevic |
Two measures for proving Gentzen's Hauptsatz without mix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(4), pp. 371-387, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Grigori Mints |
Proof Search Tree and Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pillars of Computer Science ![In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp. 521-536, 2008, Springer, 978-3-540-78126-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Christian Urban, Bozhi Zhu |
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 409-424, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Serenella Cerrito, Delia Kesner |
Pattern Matching as Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 98-108, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Roberto Di Cosmo, Delia Kesner |
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 35-46, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Matthias Baaz, Alexander Leitsch |
Fast Cut-Elimination by Projection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 18-33, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Ulf R. Schmerl |
A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings, pp. 316-325, 1991, Springer, 3-540-55789-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Daniel Murfet, William Troiani |
Elimination and cut-elimination in multiplicative linear logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.10871, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Adam Prenosil |
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 105(6), pp. 1255-1289, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Baaz, Alexander Leitsch |
Cut-elimination and Redundancy-elimination by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 29(2), pp. 149-177, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | José Espírito Santo |
Refocusing Generalised Normalisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 258-267, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
generalised elimination rules, multiarity, normalisation |
26 | Hidenori Kurokawa |
Hypersequent Calculus for Intuitionistic Logic with Classical Atoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 318-331, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
Higher-Order Termination: From Kruskal to Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 1-14, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Richard Bonichon, Olivier Hermant |
On Constructive Cut Admissibility in Deduction Modulo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers, pp. 33-47, 2006, Springer, 978-3-540-74463-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Agata Ciabattoni, George Metcalfe |
Bounded Lukasiewicz Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Proceedings, pp. 32-47, 2003, Springer, 3-540-40787-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Massimo Bartoletti, Roberto Zunino |
A Calculus of Contracting Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 332-341, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
circular assume-guarantee, concurrent constraints, contracts, cut elimination |
23 | James Brotherston, Cristiano Calcagno |
Classical BI: a logic for reasoning about dualising resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 328-339, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bunched implications, classical bi, display logic, semantics, completeness, cut-elimination, resource models |
23 | Carsten Schürmann 0001, Jeffrey Sarnat |
Structural Logical Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 69-80, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Twelf, Normalization, Logical Frameworks, Cut-Elimination, Logical Relations |
23 | Dominic J. D. Hughes, Rob J. van Glabbeek |
Proof nets for unit-free multiplicative-additive linear logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(4), pp. 784-842, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Linear logic, cut elimination, additives, proof nets |
23 | Agata Ciabattoni |
A proof-theoretical investigation of global intuitionistic (fuzzy) logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(4), pp. 435-457, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Modal predicate logics, Hypersequent calculi, Globalization, Cut-elimination |
23 | Gilles Dowek, Thérèse Hardin, Claude Kirchner |
Theorem Proving Modulo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 31(1), pp. 33-72, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
sequent calculus modulo, resolution, rewriting, automated theorem proving, higher-order logic, cut elimination, narrowing, Skolemization, deduction modulo |
22 | Georg Moser, Richard Zach |
The Epsilon Calculus and Herbrand Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 133-155, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hilbert's ?-calculus, epsilon theorems, Herbrand's theorem, proof complexity |
22 | Klaus Mayr |
Refinements and Extensions of Model Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning,4th International Conference, LPAR'93, St. Petersburg, Russia, July 13-20, 1993, Proceedings, pp. 217-228, 1993, Springer, 3-540-56944-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Hetzl, Alexander Leitsch, Daniel Weller 0001, Bruno Woltzenlogel Paleo |
A Clausal Approach to Proof Analysis in Second-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 214-229, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Ugo Dal Lago, Luca Roversi, Luca Vercelli |
Taming Modal Impredicativity: Superlazy Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 137-151, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Linear logic, proof theory, implicit computational complexity |
21 | Atsushi Ohori |
A proof theory for machine code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 29(6), pp. 36, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Curry-Howard isomorphism |
21 | José Espírito Santo |
Delayed Substitutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 169-183, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Hetzl, Alexander Leitsch |
Proof Transformations and Structural Invariance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic and Proof-theoretic Aspects of Non-classical Logics ![In: Algebraic and Proof-theoretic Aspects of Non-classical Logics, Papers in Honor of Daniele Mundici on the Occasion of His 60th birthday, pp. 201-230, 2006, Springer, 978-3-540-75938-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Herman Geuvers, Iris Loeb |
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 39-57, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Anna Zamansky, Arnon Avron |
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 251-265, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | François Lamarche, Lutz Straßburger |
Naming Proofs in Classical Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 246-261, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Esfandiar Haghverdi, Philip J. Scott |
Towards a Typed Geometry of Interaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 216-231, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Michel Parigot |
On Constructive Existence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers, pp. 268-273, 2004, Springer, 3-540-31428-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Sara Negri |
A normalizing system of natural deduction for intuitionistic linear logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(8), pp. 789-810, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Alessio Guglielmi, Lutz Straßburger |
A Non-commutative Extension of MELL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings, pp. 231-246, 2002, Springer, 3-540-00010-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski |
Proof Nets and Explicit Substitutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings, pp. 63-81, 2000, Springer, 3-540-67257-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Wilfried Sieg, Stanley S. Wainer |
Program Transformation and Proof Transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 7th Workshop, CSL '93, Swansea, United Kingdom, September 13-17, 1993, Selected Papers, pp. 305-317, 1993, Springer, 3-540-58277-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Linda Buisman, Rajeev Goré |
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 16th International Conference, TABLEAUX 2007, Aix en Provence, France, July 3-6, 2007, Proceedings, pp. 90-106, 2007, Springer, 978-3-540-73098-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Matthias Baaz, George Metcalfe |
Proof Theory for First Order Lukasiewicz Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 16th International Conference, TABLEAUX 2007, Aix en Provence, France, July 3-6, 2007, Proceedings, pp. 28-42, 2007, Springer, 978-3-540-73098-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Dale Miller 0001, Alexis Saurin |
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 405-419, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|