Existentially quantified variables are the source of non decidability for second order linear logic without exponentials (MALL2). We present a decision procedure for a fragment of MALL2 based on a canonical instantiation of these variables and using inference permutability in proofs. We also establish that this fragment is PSPACE-complete. Introduction The decision problem for second order linear logic without exponentials (MALL2) has given rise recently to many papers and results. P. Lincoln, A. Scedrov and N. Shankar have shown that the multiplicative fragment of second order intuitionistic linear logic (IMLL2) is undecidable by encoding second order intuitionistic propositional logic --- known to be undecidable --- into IMLL2 [10]....
AbstractThe propositional linear logic is known to be undecidable. In the current paper we prove tha...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
AbstractLinear logic is a resource-aware logic that is based on an analysis of the classical proof r...
Article dans revue scientifique avec comité de lecture.Existentially quantified variables are the so...
AbstractExistentially quantified variables are the source of non-decidability for second-order linea...
AbstractSynopsis Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order m...
Abstract. The decision problem is studied for fragments of second-order linear logic without modal-i...
AbstractThe multiplicative fragment of second order propositional linear logic is shown to be undeci...
AbstractLinear logic, introduced by Girard, is a refinement of classical logic with a natural, intri...
We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even wit...
AbstractThe decision problem is studied for the nonmodal or multiplicative-additive fragment of firs...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
In this short paper I will exhibit several mistakes in the recent attempt by Bimbò to prove the deci...
Dedicated to Yuri Gurevich on the occasion of his seventieth birthday Abstract. Let M = (A,<, P) ...
International audienceIn this short paper I will exhibit several mistakes in the recent attempt by B...
AbstractThe propositional linear logic is known to be undecidable. In the current paper we prove tha...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
AbstractLinear logic is a resource-aware logic that is based on an analysis of the classical proof r...
Article dans revue scientifique avec comité de lecture.Existentially quantified variables are the so...
AbstractExistentially quantified variables are the source of non-decidability for second-order linea...
AbstractSynopsis Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order m...
Abstract. The decision problem is studied for fragments of second-order linear logic without modal-i...
AbstractThe multiplicative fragment of second order propositional linear logic is shown to be undeci...
AbstractLinear logic, introduced by Girard, is a refinement of classical logic with a natural, intri...
We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even wit...
AbstractThe decision problem is studied for the nonmodal or multiplicative-additive fragment of firs...
AbstractThe probability of a property on the collection of all finite relational structures is the l...
In this short paper I will exhibit several mistakes in the recent attempt by Bimbò to prove the deci...
Dedicated to Yuri Gurevich on the occasion of his seventieth birthday Abstract. Let M = (A,<, P) ...
International audienceIn this short paper I will exhibit several mistakes in the recent attempt by B...
AbstractThe propositional linear logic is known to be undecidable. In the current paper we prove tha...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
AbstractLinear logic is a resource-aware logic that is based on an analysis of the classical proof r...