Skip to main content
Log in

The B4-valued propositional logic with unary logical connectives ~1 / ~2

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

A B 4-valued propositional logic will be proposed in this paper which there are three unary logical connectives ~1, ~2, ¬ and two binary logical connectives ∧, ∨, and a Gentzen-typed deduction system will be given so that the system is sound and complete with B 4-valued semantics, where B 4 is a Boolean algebra.

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. Belnap N. How a computer should think. In: Ryle G, ed. Contemporary Aspects of Philosophy. Stocksfield: Oriel Press, 1977, 30–56

    Google Scholar 

  2. Belnap N. A useful four-valued logic. In: Dunn J M, Epstein G, eds. Modern Uses of Multiple-valued Logic. Dordrecht: D. Reidel, 1977, 8–37

    Google Scholar 

  3. Bergstra J A, Ponse A. Kleene’s three-valued logic and process algebra. Information Processing Letters, 1998, 67(2): 95–103

    Article  MathSciNet  MATH  Google Scholar 

  4. Bergstra J A, Ponse A. Process algebra with four-valued logic. Journal of Applied Non-Classical Logics, 2000, 10(1): 27–53

    Article  MathSciNet  MATH  Google Scholar 

  5. Rodrigues O, Russo A. A translation method for Belnap logic. Imperial College RR DoC98/7, 1998

    Google Scholar 

  6. Ponse A, van der Zwaag M B. A generalization of ACP using Belnap’s logic. Electronic Notes in Theoretical Computer Science, 2006, 162: 287–293

    Article  MATH  Google Scholar 

  7. Li W. Mathematical Logic, Foundations for Information Science (Progress in Computer Science and Applied Logic). Berlin: Birkhäuser, 2010

    Google Scholar 

  8. Pynko A P. On Priest’s logic of paradox. Journal of Applied Non-Classical Logics, 1995, 5(2): 219–225

    Article  MathSciNet  MATH  Google Scholar 

  9. Pynko A P. Characterizing Belnap’s logic via De Morgan’s laws. Mathematical Logic Quarterly, 1995, 41(4): 442–454

    Article  MathSciNet  MATH  Google Scholar 

  10. Pynko A P. Implicational classes of DeMorgan lattices. Discrete mathematics, 1999, 205(1): 171–181

    Article  MathSciNet  MATH  Google Scholar 

  11. Font J M. Belnap’s four-valued logic and De Morgan lattices. Logic Journal of the I.G.P.L., 1997, 5(3): 413–440

    MathSciNet  MATH  Google Scholar 

  12. Gottwald S. A Treatise on Many-Valued Logics (Studies in Logic and Computation). Baldock: Research Studies Press Ltd, 2001

    MATH  Google Scholar 

  13. Urquhart A. Basic many-valued logic. In: Gabbay D, Guenthner F, eds. Handbook of Philosophical Logic, Vol. 2. 2nd ed. Dordrecht: Kluwer, 2001, 249–295

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 91224006 and 61173063) and the Ministry of Science and Technology (201303107).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuefei Sui.

Additional information

Wei Li is a professor in the School of Computer Science and Engineering, Beihang University, China and is a member of the Chinese Academy of Sciences, China. He is mostly engaged in the applied research of computer software and theory, and the Internet, including programming languages, software development, artificial intelligence, and integrated circuit design.

Yuefei Sui is a professor in the Institute of Computing Technology, Chinese Academy of Sciences, China. His main interests include knowledge representation, applied logic and the theory of computability.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, W., Sui, Y. The B4-valued propositional logic with unary logical connectives ~1 / ~2 /¬. Front. Comput. Sci. 11, 887–894 (2017). https://doi.org/10.1007/s11704-016-5299-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-016-5299-7

Keywords

Navigation