Agata Ciabattoni

Anna Zamansky

Proceedings of the Computer Science, 2009

Expanding the Realm of Systematic Proof Theory.

[BibT_eX]

[DOI]

Lutz Straßburger

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Density elimination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Towards an algorithmic construction of cut-elimination procedures.

[BibT_eX]

[DOI]

Alexander Leitsch

Math. Struct. Comput. Sci., 2008

Cut Elimination for First Order Gödel Logic by Hyperclause Resolution.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

From Axioms to Analytic Rules in Nonclassical Logics.

[BibT_eX]

[DOI]

Nikolaos Galatos

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2007

Density Elimination and Rational Completeness for First-Order Logics.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2006

Towards a Semantic Characterization of Cut-Elimination.

[BibT_eX]

[DOI]

Stud Logica, 2006

Service QoS Composition at the Level of Part Names.

[BibT_eX]

[DOI]

Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

Modular Cut-Elimination: Finding Proofs or Counterexamples.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

2005

Editorial.

[BibT_eX]

[DOI]

Log. J. IGPL, 2005

A proof-theoretical investigation of global intuitionistic (fuzzy) logic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2005

2004

Analytic Calculi for Monoidal T-norm Based Logic.

[BibT_eX]

[DOI]

Franco Montagna

Fundam. Informaticae, 2004

Uniform Rules and Dialogue Games for Fuzzy Logics.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

Automated Generation of Analytic Calculi for Logics with Linearity.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Hypersequent Calculi for Gödel Logics - a Survey.

[BibT_eX]

[DOI]

J. Log. Comput., 2003

Bounded Lukasiewicz Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

2002

A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

2001

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models.

[BibT_eX]

[DOI]

J. Log. Comput., 2001

Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2001

Hypersequents as a Uniform Framework for Urquhart's C, MTL and Related Logics.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

2000

Sequent calculi for finite-valued Lukasiewicz logics via Boolean decompositions.

[BibT_eX]

[DOI]

Stefano Aguzzoli

Antonio Di Nola

J. Log. Comput., 2000

Finiteness in Infinite-Valued Lukasiewicz Logic.

[BibT_eX]

[DOI]

Stefano Aguzzoli

J. Log. Lang. Inf., 2000

Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics.

[BibT_eX]

[DOI]

Mauro Ferrari

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Quantified Propositional Gödel Logics.

[BibT_eX]

[DOI]

Richard Zach

Proceedings of the Logic for Programming and Automated Reasoning, 2000

On Urquhart's C Logic.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic, 2000

1999

Bounded Contraction in Systems with Linearity.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

On the Undecidability of some Sub-Classical First-Order Logics.

[BibT_eX]

[DOI]

Helmut Veith

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

Cut-free proof systems for logics of weak excluded middle.

[BibT_eX]

[DOI]

Dov M. Gabbay

Nicola Olivetti

Soft Comput., 1998

Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics.

[BibT_eX]

[DOI]

Helmut Veith

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

A Sufficient Condition for Completability of Partial Combinatory Algebras.

[BibT_eX]

[DOI]

Andrea Asperti

J. Symb. Log., 1997

Two Connections Between Linear Logic and Lukasiewicz Logics.

[BibT_eX]

[DOI]

Duccio Luchi

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1995

Effective Applicative Structures.

[BibT_eX]

[DOI]

Andrea Asperti