Abstract. We describe the rules of linear logic modulo and we prove its sound-ness/completeness wrt phase semantics. Then we prove cut elimination for some conditions on rewrite rules, some of which are new (positivity/negativity). At last, we give hints of proofs nets modulo.
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J...
International audienceAbstract One of the most fundamental properties of a proof system is analytici...
International audienceAbstract Linear logic (LL) has been used as a foundation (and inspiration) for...
Proof Theory is the result of a tumultuous history, developed on the periphery of mainstream mathema...
We present a sequent calculus for the modal logic S4, and by building on some relevant features of t...
B stand for formulas. The connectives of propositional linear logic are: ffl the multiplicatives A ...
AbstractWe give a natural extension of Girard phase semantics of the linear logic [1] to the classic...
AbstractWe give a natural extension of Girard's phase semantic completeness proof of the (first orde...
Abstract. Deduction modulo is a powerful way to replace axioms by rewrite rules and allows to integr...
We describe in full detail a solution to the problem of proving the cut elimination theorem for FILL...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
In this paper a sequent calculus is proposed for the modal logic GLlin and the cut-elimination theor...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J...
International audienceAbstract One of the most fundamental properties of a proof system is analytici...
International audienceAbstract Linear logic (LL) has been used as a foundation (and inspiration) for...
Proof Theory is the result of a tumultuous history, developed on the periphery of mainstream mathema...
We present a sequent calculus for the modal logic S4, and by building on some relevant features of t...
B stand for formulas. The connectives of propositional linear logic are: ffl the multiplicatives A ...
AbstractWe give a natural extension of Girard phase semantics of the linear logic [1] to the classic...
AbstractWe give a natural extension of Girard's phase semantic completeness proof of the (first orde...
Abstract. Deduction modulo is a powerful way to replace axioms by rewrite rules and allows to integr...
We describe in full detail a solution to the problem of proving the cut elimination theorem for FILL...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
In this paper a sequent calculus is proposed for the modal logic GLlin and the cut-elimination theor...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
AbstractCerrito (1990) has proposed a declarative semantics for allowed logic programs using Girard'...
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abs...
Add to ORKG