A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. LICS 95, pages 496-504, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Bottom-up Semantics for Linear Logic Programs - Bozzano, Delzanno, Martelli (2000) (1 citation) (Correct)
....and returns a symbolic representation of O(P ) As a corollary of Theorem 5.10, we obtain the following result. Corollary 5.11. The provability of P ) G in propositional LO is decidable. In view of Prop. 3. 1, this result can be considered as an instance of the general decidability result [25] for propositional ane linear logic (i.e. linear logic with weakening) Example 5.12. We calculate the xpoint semantics in a simple case. We have an LO program P made up of ve clauses: 1: a b . ....
A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. of the 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, 1995.
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997) (12 citations) (Correct)
....fragment MALL is decidable, in fact PSPACE complete [LMSS92] but the decidability of the multiplicative exponential fragment MELL is still an open problem. For affine logic, that is, linear logic with weakening, the situation is somewhat better: the full propositional fragment LLW is decidable [Kop95a]. Here, we show that the finite phase semantics is complete for MALL and for LLW, but not for MELL. In particular, this gives a new proof of the decidability of LLW. The noncommutative case is mentioned, but not handled in detail. 1. Syntax of linear logic Roman capitals A, B stand for formulas. ....
....Say that an ideal is principal if it is of the form xM for some x 2 M , and say that it is of finite type if it is a finite union of principal ideals. Finally, say that M is noetherian if all its ideals are of finite type. We shall need the following classical result, which is also crucial in [Kop95a]: Lemma 4. Any finitely generated free commutative monoid is noetherian. Proof. Such a monoid is isomorphic to N k with addition, and an ideal of N k is a subset of N k which is upwards closed for the usual ordering. N is clearly noetherian: its ideals are empty or principal. To see that ....
A. P. Kopylov. Propositional linear logic with weakening is decidable. In Proc. 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, IEEE Computer Society Press. 1995.
An Effective Bottom-Up Semantics for First-Order Linear .. - Bozzano, Delzanno.. (2001) (Correct)
No context found.
A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. LICS 95, pages 496-504, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC