Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui |
Algebraic proof theory for substructural logics: Cut-elimination and completions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 163(3), pp. 266-290, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Kai Brünnler, Thomas Studer |
Syntactic cut-elimination for a fragment of the modal mu-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 163(12), pp. 1838-1853, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Rajeev Goré, Revantha Ramanayake |
Valentini's Cut-Elimination for Provability Logic resolved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 5(2), pp. 212-238, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Meghdad Ghari |
Cut Elimination and Realization for Epistemic Logics with Justification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 22(5), pp. 1171-1198, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Denis Cousineau 0002, Olivier Hermant |
A Semantic Proof that Reducibility Candidates entail Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan, pp. 133-148, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-38-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Stefan Hetzl, Lutz Straßburger |
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, pp. 320-334, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-42-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Ryuta Arisaka, Shengchao Qin |
LBI Cut Elimination Proof with BI-MultiCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TASE ![In: Sixth International Symposium on Theoretical Aspects of Software Engineering, TASE 2012, 4-6 July 2012, Beijing, China, pp. 235-238, 2012, IEEE Computer Society, 978-0-7695-4751-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Michael Gabbay 0001 |
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 76(2), pp. 673-699, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Matthias Baaz, Stefan Hetzl |
On the non-confluence of cut-elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 76(1), pp. 313-340, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Arnold Beckmann, Samuel R. Buss |
Corrected upper bounds for free-cut elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(39), pp. 5433-5445, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Dirk Pattinson, Lutz Schröder |
Generic Modal Cut Elimination Applied to Conditional Logics ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 7(1), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | André Platzer |
The Structure of Differential Invariants and Differential Cut Elimination ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 8(4), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Toshiyasu Arai |
Quick cut-elimination for strictly positive cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 162(10), pp. 807-815, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Norihiro Kamide, Heinrich Wansing |
Completeness and cut-elimination theorems for trilattice logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 162(10), pp. 816-835, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Lutz Straßburger |
From Deep Inference to Proof Nets via Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 21(4), pp. 589-624, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Björn Lellmann, Dirk Pattinson |
Cut Elimination for Shallow Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011. Proceedings, pp. 211-225, 2011, Springer, 978-3-642-22118-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Rajeev Goré, Linda Postniece, Alwen Tiu |
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.4793, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
19 | Alwen Tiu, Alberto Momigliano |
Cut Elimination for a Logic with Induction and Co-induction ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.6171, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
19 | Nikolaos Galatos, Hiroakira Ono |
Cut elimination and strong separation for substructural logics: An algebraic approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 161(9), pp. 1097-1133, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Olivier Hermant, James Lipton |
Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 20(2), pp. 597-602, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Dirk Pattinson, Lutz Schröder |
Cut elimination in coalgebraic logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 208(12), pp. 1447-1468, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot |
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR (Dakar) ![In: Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers, pp. 136-153, 2010, Springer, 978-3-642-17510-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Rajeev Goré, Linda Postniece, Alwen Tiu |
Cut-elimination and Proof Search for Bi-Intuitionistic Tense Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 8, papers from the eighth conference on `Advances in Modal Logic,` held in Moscow, Russia, 24-27 August 2010, pp. 156-177, 2010, College Publications, 978-1-84890-013-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
19 | Kai Brünnler, Thomas Studer |
Syntactic cut-elimination for common knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 160(1), pp. 82-95, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Morten Heine Sørensen, Pawel Urzyczyn |
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 73(3), pp. 919-932, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Agata Ciabattoni, Alexander Leitsch |
Towards an algorithmic construction of cut-elimination procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 18(1), pp. 81-105, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Alwen Tiu |
Cut Elimination for a Logic with Generic Judgments and Induction ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0801.3065, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
19 | Grigori Mints |
Cut elimination for a simple formulation of epsilon calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 152(1-3), pp. 148-160, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Kentaro Kikuchi |
Call-by-name reduction and cut-elimination in classical logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 153(1-3), pp. 38-65, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Mirjana Isakovic Ilic |
Cut Elimination and Decidability for Classical Lambek Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 18(1), pp. 171-199, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller |
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 451-466, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Rajeev Goré, Linda Postniece, Alwen Tiu |
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 7, papers from the seventh conference on `Advances in Modal Logic,` held in Nancy, France, 9-12 September 2008, pp. 43-66, 2008, College Publications, 978-1-904987-68-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
19 | Rajeev Goré, Revantha Ramanayake |
Valentini's cut-elimination for provability logic resolved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 7, papers from the seventh conference on `Advances in Modal Logic,` held in Nancy, France, 9-12 September 2008, pp. 67-86, 2008, College Publications, 978-1-904987-68-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
19 | Kai Brünnler, Thomas Studer |
Syntactic Cut-elimination for Common Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
M4M ![In: Proceedings of the 5th Workshop on Methods for Modalities, M4M 2007, Cachan, France, November 29-30, 2007, pp. 227-240, 2007, Elsevier. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Kazushige Terui |
Which structural rules admit cut elimination? An algebraic criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 72(3), pp. 738-754, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | João Rasga |
Sufficient conditions for cut elimination with complexity analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 149(1-3), pp. 81-99, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Wenhui Zhang |
Structure of proofs and the complexity of cut elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 353(1-3), pp. 63-70, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Matthias Baaz, Alexander Leitsch |
Towards a clausal analysis of cut-elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 41(3-4), pp. 381-410, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Grigori Mints |
Cut Elimination for a Simple Formulation of PAepsilon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Proceedings of the 12th Workshop on Logic, Language, Information and Computation, WoLLIC 2005, Florianópolis, Santa Catarina, Brazil, July 19-22, 2005, pp. 159-169, 2005, Elsevier. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Philipp Gerhardy |
The Role of Quantifier Alternations in Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 46(2), pp. 165-171, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Luca Alberucci, Gerhard Jäger |
About cut elimination for logics of common knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 133(1-3), pp. 73-99, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Mary DeMarco, James Lipton |
Completeness and Cut-elimination in the Intuitionistic Theory of Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 15(6), pp. 821-854, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Paulo Mateus, João Rasga, Cristina Sernadas |
Modal Sequent Calculi Labelled with Truth Values: Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 13(2), pp. 173-199, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Steffen van Bakel |
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 45(1), pp. 35-63, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Serenella Cerrito, Delia Kesner |
Pattern matching as cut elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 323(1-3), pp. 71-127, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Francisco Gutiérrez, Blas C. Ruiz |
Cut Elimination in a Class of Sequent Calculi for Pure Type Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: 10th Workshop on Logic, Language, Information and Computation, WoLLIC 2003, Ouro Preto, Minas Gerais, Brazil, July 29 - August 1, 2003, pp. 105-116, 2003, Elsevier. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Steffen van Bakel |
Strongly Normalising Cut-Elimination with Strict Intersection Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITRS ![In: Intersection Types and Related Systems, ITRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 26, 2002, pp. 19-36, 2002, Elsevier. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Mitsuhiro Okada |
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 281(1-2), pp. 471-498, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Stéphane Demri, Rajeev Goré |
Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 12(5), pp. 861-884, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Christian Urban, Gavin M. Bierman |
Strong Normalisation of Cut-Elimination in Classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 45(1-2), pp. 123-155, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
19 | Jeremy Avigad |
Algebraic proofs of cut elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 49(1-2), pp. 15-30, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | J. Robin B. Cockett |
Deforestation, program transformation, and cut-elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CMCS ![In: Coalgebraic Methods in Computer Science, CMCS 2001, a Satellite Event of ETAPS 2001, Genova, Italy, April 6-7, 2001, pp. 88-127, 2001, Elsevier. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Paul C. Gilmore |
An Intensional Type Theory: Motivation and Cut-Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 66(1), pp. 383-400, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Yoshihito Tanaka |
Cut-elimination Theorems for Some Infinitary Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 47(3), pp. 327-339, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller |
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 31st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2001, Warsaw, Poland, May 22-24, 2001, Proceedings, pp. 181-186, 2001, IEEE Computer Society, 0-7695-1083-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Raymond McDowell, Dale Miller 0001 |
Cut-elimination for a logic with definitions and induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 232(1-2), pp. 91-119, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Henk Barendregt, Silvia Ghilezan |
Lambda terms for natural deduction, sequent calculus and cut elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 10(1), pp. 121-134, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Frank Pfenning |
Structural Cut Elimination: I. Intuitionistic and Classical Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 157(1-2), pp. 84-141, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Gilles Dowek |
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings, pp. 62-72, 2000, Springer, 3-540-67281-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Grigori Mints |
Cut-Elimination for Simple Type Theory with An Axiom of Choice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 64(2), pp. 479-485, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Mitsuhiro Okada |
Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 227(1-2), pp. 333-396, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Mirjana Borisavljevic |
A Cut-Elimination Proof in Intuitionistic Predicate Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 99(1-3), pp. 105-136, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Matthias Baaz, Alexander Leitsch, Georg Moser |
System Description: CutRes 0.1: Cut Elimination by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, Proceedings, pp. 212-216, 1999, Springer, 3-540-66222-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Sara Negri, Jan von Plato |
Cut elimination in the presence of axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 4(4), pp. 418-435, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Dov M. Gabbay, Nicola Olivetti |
Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 61(2), pp. 237-280, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Roy Dyckhoff, Luís Pinto 0001 |
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 60(1), pp. 107-118, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Toshiyasu Arai |
Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 95(1-3), pp. 93-184, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Grigori Mints |
Indexed systems of sequents and cut-elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Philos. Log. ![In: J. Philos. Log. 26(6), pp. 671-696, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Alessandra Carbone |
Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 83(3), pp. 249-299, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Michael Gavrilovich |
Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings, pp. 113-118, 1997, Springer, 3-540-63045-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Mitsuhiro Okada |
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Linear Logic Tokyo Meeting ![In: Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29 - April 2, 1996, pp. 154, 1996, Elsevier. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Bayu Surarso, Hiroakira Ono |
Cut Elimination in Noncommutative Substructural Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 30, pp. 13-29, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
19 | Joachim Lambek |
Cut Elimination for Classical Bilinear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 22(1/2), pp. 53-67, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Heinrich Wansing |
Strong Cut-elimination in Display Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 29, pp. 117-131, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
19 | Heinrich Wansing |
Strong Cut-Elimination for Constant Domain First-Order S5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 3(5), pp. 797-810, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Alex K. Simpson |
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, June 26-29, 1995, pp. 420-430, 1995, IEEE Computer Society, 0-8186-7050-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Frank Pfenning |
Structural Cut Elimination ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, June 26-29, 1995, pp. 156-166, 1995, IEEE Computer Society, 0-8186-7050-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Katherine A. Eastaughffe |
The geometry of interaction as a theory of cut elimination with structure-sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1995 |
RDF |
|
19 | Tatsuya Shimura, Ryo Kashima |
Cut-Elimination Theorem for the Logic of Constant Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 40, pp. 153-172, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Jacqueline Vauzeilles |
Cut Elimination for the Unified Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 62(1), pp. 1-16, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Robert A. Bull |
Cut Elimination for Propositional Dynamic Logic without. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 38(1), pp. 85-100, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Jörg Hudelmaier |
Bounds for cut elimination in intuitionistic propositional logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 31(5), pp. 331-353, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Sergei Tupailo |
Gentzen-Style and Novikov-Style Cut-Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings, pp. 493-502, 1992, Springer, 3-540-55707-5. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Marcel Crabbé |
Stratification and Cut-Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 56(1), pp. 213-226, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Wenhui Zhang |
Cut Elimination and Automatic Proof Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 91(2), pp. 265-284, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Peter Schroeder-Heister |
Cut Elimination for Logics with Definitional Reflection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nonclassical Logics and Information Processing ![In: Nonclassical Logics and Information Processing, International Workshop, Berlin, Germany, November 9-10, Proceedings, pp. 146-171, 1990, Springer, 3-540-55745-8. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
19 | Mitsuru Yasuhara |
An Addition to "Cut Elimination in ϵ-Calculi". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 35(6), pp. 483-484, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
19 | Jacqueline Vauzeilles |
Cut-elimination and interpolation for Ω-logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 27(2), pp. 161-175, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Manfred E. Szabo |
A cut elimination theorem for stationary logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 33, pp. 181-193, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Lew Gordeev |
On cut elimination in the presence of perice rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 26(1), pp. 147-164, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Silvio Valentini |
A Syntactic Proof of Cut-Elimination For GLlin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 32(7-9), pp. 137-144, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Marie-Christine Ferbus |
Functorial bounds for cut elimination inLβω. II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 25(1), pp. 13-20, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Marie-Christine Ferbus |
Functorial bounds for cut elimination inLβω. I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 24(1), pp. 141-158, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
19 | Silvio Valentini |
The modal logic of provability: Cut-elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Philos. Log. ![In: J. Philos. Log. 12(4), pp. 471-476, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
19 | Mitsuru Yasuhara |
Cut Elimination in ε-Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 28(20-21), pp. 311-316, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
19 | Wolfram Pohlers |
Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 21(1), pp. 113-129, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
19 | Wolfram Pohlers |
Cut elimination for impredicative infinitary systems. Part II ordinal analysis for iterated inductive definitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 22(1-2), pp. 69-87, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
19 | Linda Wessels |
Cut Elimination in a Gentzen-Style ϵ-Calculus Without Identity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 23(36), pp. 527-538, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
19 | Satoko Titani |
A Proof of the Cut-Elimination Theorem in Simple Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 38(2), pp. 215-226, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
16 | José Espírito Santo, Maria João Frade, Luís Pinto 0001 |
Structural Proof Theory as Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 197-211, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|