This paper presents a polarized phase semantics, with respect to which the linear fragment of
second order polarized linear logic of Laurent [15] is complete. This is done by adding a topological
structure to Girard's phase semantics [9]. The topological structure results naturally from
the categorical construction developed by Hamano—Scott [12]. The polarity shifting operator ↓ (resp. ↑)
is interpreted as an interior (resp. closure) operator in such a manner that
positive (resp. negative) formulas correspond to open (resp. closed) facts. By accommodating the exponentials of linear logic,
our model is extended to the polarized fragment of the second order linear logic.
Strong forms of completeness theorems are given to yield cut-eliminations for the both second order systems.
As an application of our semantics, the first order conservativity of linear logic is studied
over its polarized fragment of Laurent [16].
Using a counter model construction, the extension of this conservativity is shown to fail
into the second order, whose solution is posed as an open problem in [16].
After this negative result, a second order conservativity theorem is proved for an eta expanded fragment of the
second order linear logic, which fragment retains a focalized sequent property of [3].
References
V. Michele Abrusci, Sequent calculus for intuitionistic linear propositional logic, Mathematical Logic, Plenum, New York, 1990, pp. 223--242.
--------, Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, Journal of Symbolic Logic, vol. 56 (1991), no. 4, pp. 1403--1451.
Jean-Marc Andreoli, Logic programming with focusing proofs in linear logic, Journal of Logic and Computation, vol. 2 (1992), no. 3, pp. 297--347.
Jean-Marc Andreoli and Roberto Maieli, Focusing and proof-nets in linear and non-commutative logic, Logic programming and automated reasoning, 1999, pp. 321--336.
Antonio Bucciarelli and Thomas Ehrhard, On phase semantics and denotational semantics in multiplicative-additive linear logic, Annals of Pure and Applied Logic, vol. 102 (2000), no. 3, pp. 247--282.
Pierre-Louis Curien and Claudia Faggian, L-nets, strategies and proof-nets, Computer Science Logic 2005, Lecture Notes in Computer Science, Springer, 2005, pp. 167--183.
Vincent Danos, Jean-Baptiste Joinet, and Harold Schellinx, A new deconstructive logic: Linear logic, Journal of Symbolic Logic, vol. 62 (1997), no. 3, pp. 755--807.
Thomas Ehrhard, A completeness theorem for symmetric product phase spaces, Journal of Symbolic Logic, vol. 69 (2004), no. 2, pp. 340--370.
Jean-Yves Girard, Linear logic, Theoretical Computer Science, vol. 50 (1987), pp. 1--102.
Mathematical Reviews (MathSciNet):
MR899269
--------, A new constructive logic: Classical logic, Mathematical Structures in Computer Science, vol. 1 (1991), no. 3, pp. 255--296.
--------, Locus solum. From the rules of logic to the logic of rules, Mathematical Structures in Computer Science, vol. 11 (2001), no. 3, pp. 301--506.
Masahiro Hamano and Philip Scott, A categorical semantics for Polarized MALL, Annals of Pure and Applied Logic, vol. 145 (2007), pp. 276--313.
Masahiro Hamano and Ryo Takemura, An indexed system for multiplicative additive polarized linear logic, Computer Science Logic 2008, Lecture Notes in Computer Science, vol. 5213, Springer Verlag, 2008, pp. 262--277.
Yves Lafont, The finite model property for various fragments of linear logic, Journal of Symbolic Logic, vol. 62 (1997), no. 4, pp. 1202--1208.
Olivier Laurent, Polarized proof-nets: Proof-nets for LC, Proceedings of the International Conference on Typed Lambda Calculi and Applications (TLCA), 1999, pp. 213--227.
--------, Étude de la polarisation en logique, Ph.D. thesis, Institut de Mathématiques de Luminy, Université Aix-Marseille II, 2002.
--------, A proof of the focalization property of linear logic, 2005, draft.
--------, Syntax vs. semantics: A polarized approach, Theoretical Computer Science, vol. 343 (2005), no. 1--2, pp. 177--206.
Olivier Laurent and Lorenzo Tortora de Falco, Slicing polarized additive normalization, Linear Logic in Computer Science (T. Ehrhard, J.-Y. Girard, P. Ruet, and P. Scott, editors), LMS Lecture Series, vol. 316, Cambridge University Press, 2004, pp. 247--282.
Paul-André Melliès, Categorical models of linear logic revisited, Theoretical Computer Science, to appear, prépublication de l'équipe PPS (September 2003, number 22).
--------, Asynchronous games 3, An innocent model of linear logic, in CTCS04, Electronic Notes in Theoretical Computer Science, (2005).
Paul-André Melliès and Nicolas Tabareau, Resource modalities in game semantics, Proceedings of the Conference on Logic in Computer Science (LICS), 2007.
Dale Miller, An overview of linear logic programming, Linear Logic in Computer Science (T. Ehrhard, J.-Y. Girard, P. Ruet, and P. Scott, editors), LMS Lecture Series, vol. 316, Cambridge University Press, 2004, pp. 119--150.
Mitsuhiro Okada, Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic, Theoretical Computer Science, vol. 227 (1999), no. 1--2, pp. 333--396.
Mitsuhiro Okada and Kazushige Terui, The finite model property for various fragments of intuitionistic linear logic, Journal of Symbolic Logic, vol. 64 (1999), pp. 790--802.
Hiroakira Ono, Semantics for substructural logics, Substructural Logics (K. Došen and P. Schroeder-Heister, editors), Oxford University Press, 1993, pp. 259--291.
Dag Prawitz, Natural Deduction - A Proof Theoretical Study, Almquist and Wiksell, Stockholm, 1965.
Mathematical Reviews (MathSciNet):
MR193005
Giovanni Sambin, Pretopologies and completeness proofs, Journal of Symbolic Logic, vol. 60 (1995), no. 3, pp. 861--878.
R. A. G. Seely, Linear logic, $*$-autonomous categories and cofree coalgebras, Categories in Computer Science and Logic (J. Gray and A. Scedrov, editors), Contemporary Mathematics, vol. 92, 1989, pp. 371--382.
Peter Selinger, Control categories and duality: On the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol. 11 (2001), pp. 207--260.
Kazushige Terui, Which structural rules admit cut elimination? --- An algebraic criterion, Journal of Symbolic Logic, vol. 72 (2007), no. 3, pp. 738--754.
A. S. Troelstra, Lectures on Linear Logic, CSLI Lecture Notes, vol. 29, Stanford, 1992.