#### Filter Results:

- Full text PDF available (72)

#### Publication Year

1995

2018

- This year (9)
- Last 5 years (31)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui
- 2008 23rd Annual IEEE Symposium on Logic in…
- 2008

We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automated generation of… (More)

- Stefano Aguzzoli, Agata Ciabattoni
- Journal of Logic, Language and Information
- 2000

In this paper we deepen Mundici’s analysis on reducibility of the decision problem from infinite-valued Łukasiewicz logic L∞ to a suitable m-valued Łukasiewicz logic Lm, where m only depends on the… (More)

- Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui
- Ann. Pure Appl. Logic
- 2012

We carry out a unified investigation of two prominent topics in proof theory and order algebra: cut-elimination and completion, in the setting of substructural logics and residuated lattices. We… (More)

- Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
- J. Log. Comput.
- 2003

Hypersequent calculi arise by generalizing standard sequent calculi to refer to whole contexts of sequents instead of single sequents. We present a number of results using hypersequents to obtain a… (More)

We provide uniform and invertible logical rules in a framework of relational hypersequents for the three fundamental t-norm based fuzzy logics i.e., Łukasiewicz logic, Gödel logic, and Product logic.… (More)

- Agata Ciabattoni, Kazushige Terui
- Studia Logica
- 2006

We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination. Our conditions are formulated both syntactically and semantically.

- Vivek Nigam, Jean-Marc Andreoli, +22 authors Simon Kramer
- 2009

Although logic and proof theory have been successfully used as a framework for the speci cation of computation systems, there is still an important gap between the systems that logic can capture and… (More)

- Agata Ciabattoni, Kazushige Terui
- LPAR
- 2006

Modular cut-elimination is a particular notion of ”cut-elimination in the presence of non-logical axioms” that is preserved under the addition of suitable rules. We introduce syntactic necessary and… (More)

- Andrea Asperti, Agata Ciabattoni
- Category Theory and Computer Science
- 1995

An Effective Applicative Structure is a collection of partial functions over an arbitrary set M, indexed by elements of the same set, closed under composition, and containing projections, universal… (More)

- Matthias Baaz, Agata Ciabattoni, Franco Montagna
- Fundam. Inform.
- 2004

Monoidal t-norm based logic MTL is the logic of left continuous t-norms. We introduce two analytic calculi for first-order MTL. These are obtained by lifting two sequent calculi for different… (More)