Skip to main content
Log in

The global properties of valid formulas in modal logic K

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

Abstract

Global property is the necessary condition which must be satisfied by the provable formulas. It can help to find out some unprovable formula that does not satisfy some global property before proving it using formal automated reasoning systems, thus the efficiency of the whole system is improved. This paper presents some global properties of valid formulas in modal logic K. Such properties are structure characters of formulas, so they are simple and easy to check. At the same time, some global properties of K unsatisfiable formula set are also given.

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. Thistlewaite P B, McRobbie M A, Meyer R K. Automated Theorem-Proving in Non-Classical Logics. Pitman, London, 1988.

    MATH  Google Scholar 

  2. Liu Xuhua, Sun Jigui. The curry property of formal system L5 in relevant logic LR.Scientia Sinica (Series A), 1993, (12).

  3. Sun Jigui. Automated theorem proving based on generalized resolution & automated reasoning in non-classical logics. Ph.D. Thesis, Computer Science Department, Jilin University, Oct. 1993.

  4. Fitting M. Proof methods for modal and intuitionistic logics. Volume 169 of Symthese Library, Holland, 1983.

  5. Catach L. TABLEAUX: A general theorem prover for modal logics.Journal of Automated Reasoning, 1991, 7: 489–510.

    Article  MATH  MathSciNet  Google Scholar 

  6. Wallen L A. Automated Deduction in Nonclassical Logics. The MIT Press, 1989.

  7. Farinas del Cerro L. A simple deduction method for modal logic.Information Processing Letters, 1982, 14(2): 47–51.

    Article  MathSciNet  Google Scholar 

  8. Enjalbert P, Farinas del Cerro L. Modal resolution in clausal form.Theoret. Comput. Sci., 1989, 65: 1–34.

    Article  MATH  MathSciNet  Google Scholar 

  9. Cialdea M. Resolution for some first-order modal systems.Theoret. Comput. Sci., 1991, 85: 213–229.

    Article  MATH  MathSciNet  Google Scholar 

  10. Sun Jigui, Liu Xuhua. Deletion strategy using weak subsumption relation for modal resolution.Chinese Journal of Computers, 1994, 17(5).

    Google Scholar 

  11. Smullyan R M. First-Order Logic. Springer-Verlag, 1968.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research is supported by the National Natural Science Foundation and the National High Technology Development Program of China.

Sun Jigui was born in 1962. He received his Ph.D. degree from Jilin University on computer science in 1993. Now he is an Associate Professor with Department of Computer Science, Jilin University. His research interests include automated reasoning and knowledge engineering.

Cheng Xiaochun was born in 1973. He is now a Ph.D. candidate in Jilin University. His research interests are fuzzy logic and fuzzy reasoning.

Liu Xuhua was born in 1937. He is now a Professor of Department of Computer Science, Jilin University. His research interests include artificial intelligence and computer software.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, J., Cheng, X. & Liu, X. The global properties of valid formulas in modal logic K. J. of Comput. Sci. & Technol. 11, 615–621 (1996). https://doi.org/10.1007/BF02951625

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation