Skip to main content
Log in

Phase semantics for a pure noncommutative linear propositional logic

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We use a many-sorted language to remove commutativity from phase semantics of linear logic and show that pure noncommutative intuitionistic linear propositional logic plus two classical rules enjoys the soundness and completeness with respect to completely noncommutative phase semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Girard J-Y. Linear logic.Theoretic Computer Sci., 1987, 50: 1–102.

    Article  MATH  MathSciNet  Google Scholar 

  2. Girard J-Y. Towards a geometry of interaction. InCategories in Computer Science and Logic. Contemporary Mathematics 92, American Mathematical Society, Providence, Rhode Island, 1989, pp.69–108.

    Google Scholar 

  3. Yetter D N. Quantales and (noncommutative) linear logic.J. Symbolic Logic, 1990, 55: 41–64.

    Article  MATH  MathSciNet  Google Scholar 

  4. Abrusci V M. Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic.J. Symbolic Logic, 1991, 56: 1403–1451.

    Article  MATH  MathSciNet  Google Scholar 

  5. Abrusci V M. Noncommutative intuitionistic linear propositional logic.Zeitsch. f. Math. Logik und Grundlagen d. Math., 1990, 36: 297–318.

    Article  MATH  MathSciNet  Google Scholar 

  6. Abrusci V M. Sequent calculus for intuitionistic linear propositional logic.Mathematical Logic, P. P. Petkov (ed.), New York: Plenum Press, 1990, pp.223–242.

    Google Scholar 

  7. Abrusci V M. A comparison between Lambek syntactic calculus and intuitionistic linear logic.Zeitsch. f. Math. Logik und Grundlagen d. Math., 1990, 36: 11–15.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by National Hi-Tech Program and the National Natural Science Foundation of China and Fok Ying-Tung Education Foundation.

YING Mingsheng graduated from Fuzhou Teacher’s College in 1981. From 1992 to 1997, he was a Professor at Department of Mathematics, Jiangxi Normal University and Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics. Now, he is at Department of Computer Science and Technology, Tsinghua University. His research interests include mathematical logic, theoretic computer science and fuzzy logic.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ying, M. Phase semantics for a pure noncommutative linear propositional logic. J. Comput. Sci. & Technol. 14, 135–139 (1999). https://doi.org/10.1007/BF02946519

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946519

Keywords

Navigation