To show that a formula A is not provable in propositional classical logic, it suuces to exhibit a nite boolean model which does not satisfy A. A similar property holds in the intuitionistic case, with Kripke models instead of boolean models (see for instance TvD88]). One says that the propositional classical logic and the propositional intuitionistic logic satisfy a nite model property. In particular, they are decidable: there is a semi-algorithm for provability (proof search) and a semi-algorithm for non provability (model search). For that reason, a logic which is undecidable, such as rst order logic, cannot satisfy a nite model property. The case of linear logic is more complicated. The full propositional fragment LL has a complete semantics in terms of phase spaces Gir87, Gir95], but it is undecidable LMSS92]. The multiplicative additive fragment MALL is decidable, in fact PSPACE-complete LMSS92], but the decidability of the multiplicative exponential fragment MELL is still an open problem. For aane 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 nite 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. The connectives of propositional linear logic are: the multiplicatives A (?A) ? = !A ? : One writes A ? B for A ? & B. Greek capitals ?, stand for sequents, which are multisets of formulas, so that exchange is implicit. Identity and cut are written as follows:
[1]
Jean-Yves Girard,et al.
Linear Logic
,
1987,
Theor. Comput. Sci..
[2]
Yves Lafont.
The Undecidability of Second Order Linear Logic Without Exponentials
,
1996,
J. Symb. Log..
[3]
Andre Scedrov,et al.
The Undecidability of Second Order Multiplicative Linear Logic
,
1996,
Inf. Comput..
[4]
Max I. Kanovich.
Simulating Computations in Second Order Non-Commutative Linear Logic
,
1996,
Electron. Notes Theor. Comput. Sci..
[5]
V. Michele Abrusci.
Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic
,
1991,
J. Symb. Log..
[6]
Peter Deussen,et al.
Theoretical computer science : 5th GI-Conference, Karlsruhe, March 23-25, 1981
,
1981
.
[7]
Patrick Lincoln,et al.
Linear logic
,
1992,
SIGA.
[8]
Jean-Yves Girard,et al.
Linear logic: its syntax and semantics
,
1995
.
[9]
Alexey P. Kopylov.
The Undecidability of Second Order Linear Affine Logic
,
1997,
LFCS.