Please wait a minute...

Frontiers of Computer Science

Front. Comput. Sci.    2017, Vol. 11 Issue (5) : 887-894     DOI: 10.1007/s11704-016-5299-7
The B4-valued propositional logic with unary logical connectives ∼1 / ∼2
Wei LI1, Yuefei SUI2()
1. State Key Laboratory of Software Development Environment, Beijing University of Aeronautics and Astronautics, Beijing 100191, China
2. Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
Download: PDF(264 KB)  
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

A B4-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 B4-valued semantics, where B4 is a Boolean algebra.

Keywords the Belnap logic      modality      the soundness      the completeness     
Corresponding Authors: Yuefei SUI   
Just Accepted Date: 23 June 2016   Online First Date: 09 June 2017    Issue Date: 26 September 2017
 Cite this article:   
Wei LI,Yuefei SUI. The B4-valued propositional logic with unary logical connectives ∼1 / ∼2 /¬[J]. Front. Comput. Sci., 2017, 11(5): 887-894.
E-mail this article
E-mail Alert
Articles by authors
Wei LI
Yuefei SUI
1 BelnapN. How a computer should think. In: Ryle G, ed. Contemporary Aspects of Philosophy. Stocksfield: Oriel Press, 1977, 30–56
2 BelnapN. A useful four-valued logic. In: Dunn J M, Epstein G, eds. Modern Uses of Multiple-valued Logic. Dordrecht: D. Reidel, 1977, 8–37
doi: 10.1007/978-94-010-1161-7_2
3 BergstraJ A, PonseA. Kleene’s three-valued logic and process algebra. Information Processing Letters, 1998, 67(2): 95–103
doi: 10.1016/S0020-0190(98)00083-0
4 BergstraJ A, PonseA. Process algebra with four-valued logic. Journal of Applied Non-Classical Logics, 2000, 10(1): 27–53
doi: 10.1080/11663081.2000.10510987
5 RodriguesO, RussoA. A translation method for Belnap logic. Imperial College RR DoC98/7, 1998
6 PonseA, van der Zwaag M B. A generalization of ACP using Belnap’s logic. Electronic Notes in Theoretical Computer Science, 2006, 162: 287–293
doi: 10.1016/j.entcs.2005.12.102
7 LiW. Mathematical Logic, Foundations for Information Science (Progress in Computer Science and Applied Logic). Berlin: Birkhäuser, 2010
8 PynkoA P. On Priest’s logic of paradox. Journal of Applied Non- Classical Logics, 1995, 5(2): 219–225
9 PynkoA P. Characterizing Belnap’s logic via De Morgan’s laws. Mathematical Logic Quarterly, 1995, 41(4): 442–454
doi: 10.1002/malq.19950410403
10 PynkoA P.Implicational classes of DeMorgan lattices. Discrete mathematics, 1999, 205(1): 171–181
doi: 10.1016/S0012-365X(99)00007-2
11 FontJ M. Belnap’s four-valued logic and De Morgan lattices. Logic Journal of the I.G.P.L., 1997, 5(3): 413–440
doi: 10.1093/jigpal/5.3.1-e
12 GottwaldS. A Treatise on Many-Valued Logics (Studies in Logic and Computation). Baldock: Research Studies Press Ltd, 2001
[1] FCS-0887-15299-YFS_suppl_1 Download
Full text