Abstract
A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L3-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed.
Similar content being viewed by others
References
Avron A. Natural 3-valued logics-characterization and proof theory. The Journal of Symbolic Logic, 1991, 56(1): 276–294
Avron A. Gentzen-type systems, resolution and tableaux. Journal of Automated Reasoning, 1993, 10: 265–281
Li W, Sui Y. Multisequent Gentzen deduction systems for B 22 -valued first-order logic. Articial Intelligence Research, 2018, 7(1): 53–62
Baaz M, Fermüller C G, Salzer G, Zach R. Labeled calculi and finite-valued logics. Studia Logica, 1998, 61: 7–33
Fitting M C. Many-valued modal logics. Fundamenta Informaticae, 1991, 15(3–4): 235–254
Zach R. Proof theory of finite-valued logics. Technical Report TUW-E185.2-Z.1-93, Institut Für Computersprachen, Technische Universität Wien, 1993
Malinowski G. Many-valued logic and its philosophy. In: Gabbay D M, Woods D J, eds. Handbook of the History of Logic, Vol.8. The Many Valued and Nonmonotonic Turn in Logic. Elsevier, 2009
Post E L. Determination of all closed systems of truth tables. Bulletin American Mathematical Society, 1920, 26: 437
Li W. Mathematical Logic, Foundations for Information Science. Progress in Computer Science and Applied Logic, vol.25. Birkhäuser, 2010
Acknowledgements
This work was supported by the Open Fund of the State Key Laboratory of Software Development Environment (SKLSDE-2010KF-06), Beijing University of Aeronautics and Astronautics, and by the National Basic Research Program of China (973 Program) (2005CB321901)
Author information
Authors and Affiliations
Corresponding author
Additional information
Wei Li is a PhD, Professor, PhD supervisor, and Academician of Chinese Academy of Sciences, China. He is a professor in the School of Computer Science and Engineering, Beihang University, China. His main research interests include computer science theory and software foundation, theory and practice of unstructured data, and analysis and processing of big data.
Yuefei Sui is a PhD, Professor, PhD supervisor, and a member of China Computer Federation. He is a professor in the Institute of Computing Technology, Chinese Academy of Sciences, and is a professor in School of Computer Science and Technology, University of Chinese Academy of Sciences, China. His main research interests include foundation of large-scale knowledge process and mathematical logic.
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Li, W., Sui, Y. Monotonicity and nonmonotonicity in L3-valued propositional logic. Front. Comput. Sci. 16, 164315 (2022). https://doi.org/10.1007/s11704-021-0382-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-021-0382-0