AbstractWe make a study of lattices representable by commuting equivalence relations, which we call linear lattices. We develop a proof theory for implications valid in linear lattices, which differs from classical proof theories in that its deductions transform representative graphs rather than well-formed formulas. Using graphtheoretic arguments, we establish a duality theorem and a normal form theorem for this proof theory
The purpose of this paper is to give an exposition of material dealing with constructive logics, typ...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
13th Annual Conference of the EACSL. Colloque avec actes et comité de lecture. internationale.Intern...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
In this paper we introduce a new natural deduction system for the logic of lattices, and a numbe...
The theory of linear lattices is presented as a system with multiple-conclusion rules. It is shown t...
In this paper we introduce a new natural deduction system for the logic of lattices, and a number of...
C1 - Journal Articles RefereedAbstract In this paper we introduce a new natural deduction system fo...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
Abstract—In Girard’s original presentation, proof structures of Linear Logic are hypergraphs whose h...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
The purpose of this paper is to give an exposition of material dealing with constructive logics, typ...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
13th Annual Conference of the EACSL. Colloque avec actes et comité de lecture. internationale.Intern...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
AbstractIt is well-known that every proof net of a non-commutative version of MLL (Multiplicative fr...
In this paper we introduce a new natural deduction system for the logic of lattices, and a numbe...
The theory of linear lattices is presented as a system with multiple-conclusion rules. It is shown t...
In this paper we introduce a new natural deduction system for the logic of lattices, and a number of...
C1 - Journal Articles RefereedAbstract In this paper we introduce a new natural deduction system fo...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
Abstract—In Girard’s original presentation, proof structures of Linear Logic are hypergraphs whose h...
An interesting problem in proof theory is to find representations of proof that do not distinguish b...
In this thesis we investigate certain structural refinements of multiplicative linear logic, obtaine...
The purpose of this paper is to give an exposition of material dealing with constructive logics, typ...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
13th Annual Conference of the EACSL. Colloque avec actes et comité de lecture. internationale.Intern...