| From axioms to analytic rules in nonclassical logics A Ciabattoni, N Galatos, K Terui 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 229-240, 2008 | 174 | 2008 |
| Hypersequent calculi for Gödel logics—a survey M Baaz, A Ciabattoni, CG Fermüller Journal of Logic and Computation 13 (6), 835-861, 2003 | 105 | 2003 |
| Algebraic proof theory for substructural logics: cut-elimination and completions A Ciabattoni, N Galatos, K Terui Annals of Pure and Applied Logic 163 (3), 266-290, 2012 | 100 | 2012 |
| Finiteness in infinite-valued Łukasiewicz logic S Aguzzoli, A Ciabattoni Journal of Logic, Language and Information 9 (1), 5-29, 2000 | 80 | 2000 |
| T-norm based logics with n-contraction A Ciabattoni, F Esteva, L Godo Neural Network World 12 (5), 441-452, 2002 | 76 | 2002 |
| Uniform rules and dialogue games for fuzzy logics A Ciabattoni, CG Fermüller, G Metcalfe Logic for Programming, Artificial Intelligence, and Reasoning: 11th …, 2005 | 69 | 2005 |
| Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions A Ciabattoni, G Metcalfe, F Montagna Fuzzy sets and systems 161 (3), 369-389, 2010 | 65 | 2010 |
| Towards a semantic characterization of cut-elimination A Ciabattoni, K Terui Studia Logica, 95-119, 2006 | 57 | 2006 |
| Herbrand’s theorem for prenex Gödel logic and its consequences for theorem proving M Baaz, A Ciabattoni, CG Fermüller Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 2001 | 46 | 2001 |
| Analytic calculi for monoidal t-norm based logic M Baaz, A Ciabattoni, F Montagna Fundamenta Informaticae 59 (4), 315-332, 2004 | 45 | 2004 |
| Hypersequent calculi for some intermediate logics with bounded Kripke models A Ciabattoni Journal of Logic and Computation 11 (2), 283-294, 2001 | 41 | 2001 |
| Expanding the realm of systematic proof theory A Ciabattoni, L Straßburger, K Terui International Workshop on Computer Science Logic, 163-178, 2009 | 40 | 2009 |
| Density elimination A Ciabattoni, G Metcalfe Theoretical Computer Science 403 (2-3), 328-346, 2008 | 40 | 2008 |
| Cut-free proof systems for logics of weak excluded middle A Ciabattoni, DM Gabbay, N Olivetti Soft Computing 2, 147-156, 1999 | 38 | 1999 |
| Hypersequent and display calculi–a unified perspective A Ciabattoni, R Ramanayake, H Wansing Studia Logica 102, 1245-1294, 2014 | 35 | 2014 |
| Power and limits of structural display rules A Ciabattoni, R Ramanayake ACM Transactions on Computational Logic (TOCL) 17 (3), 1-39, 2016 | 34 | 2016 |
| Hypersequent and labelled calculi for intermediate logics A Ciabattoni, P Maffezioli, L Spendier Automated Reasoning with Analytic Tableaux and Related Methods: 22nd …, 2013 | 31 | 2013 |
| Adding modalities to MTL and its extensions A Ciabattoni, G Metcalfe, F Montagna Proceedings of the Linz Symposium 2005, 2005 | 27 | 2005 |
| Bounded Łukasiewicz logics A Ciabattoni, G Metcalfe Automated Reasoning with Analytic Tableaux and Related Methods …, 2003 | 27 | 2003 |
| MacNeille completions of FL-algebras A Ciabattoni, N Galatos, K Terui Algebra universalis 66 (4), 405-420, 2011 | 26 | 2011 |
George MetcalfeProfessor of Mathematics, University of Bern在 unibe.ch 的电子邮件经过验证
George MetcalfeProfessor of Mathematics, University of Bern在 unibe.ch 的电子邮件经过验证