Books

• Logica a informatica, McGraw-Hill, 1997 (with A. Asperti). In Italian.
  (The book is used for these logic courses)

Special Issues Edited

• MFCS and CSL 2010 Satellite Workshops: Selected Papers. Fundamenta Informaticae 123(1), IOS Press, 2013 (with R. Freivalds, A. Kucera, I. Potapov and S. Szeider)
• Algebraic and Proof-theoretic Aspects of Non-classical Logics - Papers in honour of Daniele Mundici on the occasion of his 60th birthday, LNCS 4460, Springer, 2007 (with S. Aguzzoli, B. Gerla, C. Manara and V. Marra).
• Proceedings of COS04 and Ercim (Volume I), Special Issue of the Logic Journal of IGPL 13(4), July 2005 (with M. Baaz, D.M. Gabbay, and P. Hájek).
• Proceedings of COS04 and Ercim (Volume II), Special Issue of the Logic Journal of IGPL 13(5), September 2005 (with M. Baaz, D.M. Gabbay, and P. Hájek).

International Journals

• Proof theory for locally finite many-valued logics: semi-projective logics. Accepted for Publication in Theoretical Computer Science
  (with F. Montagna). PDF
• Formal approaches to rule-based systems in medicine: the case of CADIAG2, Journal of Approximate Reasoning 54(1): 132-148, 2013 (with D. Picado, T. Vetterlein and M. El-Zekey). PDF
• Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability, Logical Methods for Computer Science 8(1), 2012 (with M. Baaz and C.G. Fermüller). PDF
• Algebraic proof theory for substructural logics: cut-elimination and completions, Annals of Pure and Applied Logic, 163(3): 266-290, 2012 (with N. Galatos and K. Terui). PDF
• First-order satisfiability in Gödel logics: an NP-complete fragment, Theoretical Computer Science, 412: 6612-6623, 2011
  (with M. Baaz and N. Preining). PDF
• MacNeille Completions of FL-algebras, Algebra Universalis 66(4): 405-420, 2011 (with N. Galatos and K. Terui). PDF
• On the (fuzzy) logical content of CADIAG-2, Fuzzy Sets and Systems, 161(14): 1941-1958, 2010 (with T. Vetterlein). PDF
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions, Fuzzy Sets and Systems, 161(3): 369-389, 2010 (with G. Metcalfe and F. Montagna). PDF
• Density Elimination, Theoretical Computer Science 403(2-3): 328-346, 2008 (with G. Metcalfe). PDF
• Towards an Algorithmic Construction of Cut-Elimination Procedures, Mathematical Structures in Computer Science 18(1): 81-105, 2008 (with A. Leitsch). PDF
• Towards a semantic characterization of cut-elimination, Studia logica 82(1): 95-119, 2006 (with K. Terui). PDF (Addenda)
• A Proof-theoretical Investigation of Global Intuitionistic (Fuzzy) Logic, Archive of Mathematical Logic 44: 435-457, 2005. PDF
• Analytic Calculi for Monoidal T-norm Based Logic, Fundamenta Informaticae, Vol. 59, N. 4, 315-332, 2004, (with M. Baaz and F. Montagna). PS
• Hypersequent Calculi for Gödel Logics - a Survey, Journal of Logic and Computation 13: 835-861, 2003 (with M. Baaz and C.G. Fermüller). PDF
• T-norm based logics with n-contraction, Neural Network World 12(5): 441-452, 2002 (with F. Esteva and L. Godo). PS
• Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models, Journal of Logic and Computation 11(2): 283-294, 2001 (with M. Ferrari). PDF (Corrigenda)
• Finiteness of infinite-valued Lukasiewicz logic, Journal of Logic, Language and Information 9: 5-29, 2000 (with S. Aguzzoli). PS
• Sequent calculi for finite-valued Lukasiewicz logics via boolean decompositions, Journal of Logic and Computation 10(2): 213-222, 2000 (with S. Aguzzoli and A. Di Nola).
• Cut free proof systems for logics of weak excluded middle, Soft Computing 2(4): 147-156, 1998 (with D.M. Gabbay and N. Olivetti).
• A Sufficient Condition for Completability of Partial Combinatory Algebras, Journal of Symbolic Logic 62(4): 1209-1214, 1997 (with A. Asperti).

International Conferences

• Structural extensions of display calculi: a general recipe, Proceedings of WOLLIC 2013 , (with R. Ramanayake). PDF
• Automated Support for the Investigation of Paraconsistent and Other Logics, Proceedings of the Symposium on Logical Foundations in Computer Science 2013, LFCS 2013, S. Artemov and A. Nerode (Eds.), LNCS (with O. Lahav, L. Spendier and A. Zamansky). PDF | Software
• Standard completeness for extensions of MTL: an automated approach, Proceedings of the Workshop on Logic, Language, Information and Computation, WOLLIC 2012, L. Ong and R. de Queiroz (Eds.), LNCS 7456, 154-167, Springer, Heidelberg, 2012 (with P. Baldi and L. Spendier). PDF
• Basic Constructive Connectives, Determinism and Matrix-based Semantics, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods, LNCS 6793, 119-133, Tableaux 2011 (with O. Lahav and A. Zamansky). PDF
• On the classical content of Gödel logic with strong negation and its application to a fuzzy medical expert system, Proceedings of Knowledge Representation and Reasoning KR2010, IEEE (with P. Rusnok). PDF
• Expanding the realm of systematic proof theory, Computer Science Logic, CSL 2009, LNCS (with L. Strassburger and K. Terui). PDF
• SAT in Monadic Gödel Logics: a borderline between decidability and undecidability, Workshop on Logic, Language, Information and Computation, WOLLIC 2009, LNAI (with M. Baaz and N. Preining). PDF
• A formal logical framework for CADIAG-2, Medical Informatics Europe, MIE 2009, Sarajevo, Studies in Health Technology and Informatics series, IOS Press (with T. Vetterlein and K-P. Adlassnig)
• Canonical Calculi: Invertibility, Axiom-Expansion and (Non)-determinism, Computer Science Symposium in Russia (CSR2009), LNCS (with A. Avron and A. Zamansky). PDF
• Cut elimination for first order Gödel logic by hyperclause resolution, Logic for Programming and Automated Reasoning (LPAR 2008), LNCS 5330, 451-466 (with M. Baaz and C.G. Fermüller). PDF
• From axioms to analytic rules in nonclassical logics, IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE, 229-240, 2008 (with N. Galatos and K. Terui). PDF | Software
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results, Logic for Programming and Automated Reasoning (LPAR 2007), LNAI 4790, 77-91, 2007 (with M. Baaz and C.G. Fermüller). PDF
• Density Elimination and Rational Completeness for First-Order Logics, Symposium on Logical Foundations of Computer Science (LFCS 2007), LNCS 4514, 132-146, 2007 (with G. Metcalfe). PDF
• Modular Cut-Elimination: Finding Proofs or Counterexamples, Logic for Programming and Automated Reasoning (LPAR 2006), LNAI 4246, 135-149, 2006 (with K. Terui). PDF
• Uniform Rules and Dialogue Games for Fuzzy Logics, Logic for Programming and Automated Reasoning (LPAR 2005), LNAI 3452, 496-510, 2004 (with C. Fermüller and G. Metcalfe). PDF
• Automated Generation of Analytic Calculi for Logics with Linearity, Computer Science Logic (CSL 2004), LNCS 3210, 505-517. PDF
• Bounded Lukasiewicz Logics, Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2003), LNAI 2796, 32-47, 2003 (with G. Metcalfe). PS
• From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games, IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), Tokyo, (Japan), May 2003, 188-193 (with C.G. Fermüller). PDF
• A Schütte-Tait style cut-elimination proof for first-order Gödel logic, Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2002), Copenhagen (Denmark), August 2002, LNAI 2381, 24-38 (with M. Baaz). PDF
• Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving, Logic for Programming and Automated Reasoning (LPAR 2001), Cuba, December 2001, LNAI 2250, 201-216 (with M. Baaz and C.G. Fermüller). PDF
• Hypersequents as a uniform framework for Urquhart's C, MTL and related logics, IEEE International Symposium on Multiple-Valued Logic (ISMVL 2001), Warsaw (Poland), May 2001, IEEE Computer Society Press, 227-232 (with C.G. Fermüller).
• Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic, IEEE International Symposium on Multiple-Valued Logic (ISMVL 2001), Warsaw (Poland), May 2001, IEEE Computer Society Press, 181-186 (with M. Baaz and C.G. Fermüller).PDF
• Quantified Propositional Gödel Logic, Logic for Programming and Automated Reasoning (LPAR 2000), Reunion Island, November 2000, LNAI 1955, 240-257, (with M. Baaz and R. Zach). PS
• Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics, Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2000), St. Andrews (Scotland), July 2000, LNAI 1847, 160-175 (with M. Ferrari). PS
• On Urquhart's C logic, IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000), Portland (USA), May 2000, IEEE Computer Society Press, 113-118. PS
• On the Undecidability of Some Sub-classical First-Order Logics, Foundations of Software Technology and Theoretical Computer Science (FST&TCS 1999), Chennai, December 1999, LNCS 1738, 258-268 (with M. Baaz , C.G. Fermüller and H. Veith). PS
• Bounded contraction in systems with linearity, Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 1999), Saratoga (NY), June 1999, LNAI 1617, 113-128.
• Proof Theory of Fuzzy Logics: Urquhart's C and related logics, Mathematical Foundations of Computer Science (MFCS'98), Brno, August 1998, LNCS 1450, 203-212 (with M. Baaz, C.G. Fermüller and H. Veith).
• Two connections between Linear Logic and Lukasiewicz Logic, Computational Logic and Proof Theory - Kurt Gödel Colloquium (KGC 1997), Vienna, August 1997, LNCS 1289, 128-139 (with D. Luchi).
• Effective Applicative Structures, Category Theory in Computer Science (CTCS 1995) Cambridge (UK), August 1995, LNCS 953, 81-95, (with A. Asperti). PDF

National Conferences

• On Completability of Partial Combinatory Algebras, Fifth Italian Conference on Theoretical Computer Science (ICTCS 1995), Ravello, Italy. November 1995. A. De Santis ed., World Scientific, 162-175 (with A. Asperti). PDF

Book Chapters

• Towards an interpretation of the medical expert system CADIAG2. Fuzziness and Medicine: Philosophy and Application Systems, R. Seising and M. Tabacchi eds. (with D. Picado and T. Vetterlein).
• Sequent of Relations Calculi: a Framework for Analytic Deduction in Many-Valued Logics, Beyond two: Theory and applications of Multiple-Valued Logics, M. Fitting and E. Orlowska eds., Physica-Verlag, 157-180, 2003 (with M. Baaz and C.G. Fermüller). PDF
• A Natural Deduction System for Intuitionistic Fuzzy Logic, Lectures on Soft Computing and Fuzzy Logic, A. Di Nola, G. Gerla eds., Physica-Verlag, 1-18, 2000 (with M. Baaz and C.G. Fermüller). PS

International Workshops

• Service QoS Composition at the Level of Part Names, Proceedings of WS-FM 2006, LNCS 4184, 24-37, 2006 (with M. Aiello, F. Rosenberg, C. Platzer and S. Dunstdar).
• A Guide to Quantified Propositional Gödel Logic, Proceedings of the IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas (QBF 2001), Siena (Italy), June 2001 (with M. Baaz , N. Preining and H. Veith).