Abstract
A formal language of two-valued logic is developed, whose terms are formulas of the language of Kleene's three-valued logic. The atomic formulas of the former language are pairs of formulas of the latter language joined by “consequence” operators. These operators correspond to the three “sensible” types of consequence (strong-strong, strong-weak and weak-weak) in Kleene's logic in analogous way as the implication connective in the classical logic corresponds to the classical consequence relation. The composed formulas of the considered language are built from the atomic ones by means of the classical connectives and quantifiers.
A deduction system for the developed language is given, consisting of a set of decomposition rules for sequences of formulas. It is shown that the deduction system is sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Blikle, B. Konikowska and A. Tarlecki, A three-valued logic for software specification and validation, LNCS, Proceedings of VDM Europe 1988, also in ICS PAS Reports, No 635.
S. C. Kleene, Introduction to Metamathematics, North Holland 1952.
G. Koletsos, Sequent calculus and partial logic, MSc thesis, The University of Manchester 1976.
B. Konikowska, A superpredicate logic over the MK-calculus, in manuscript.
H. Rasiowa and R. Sikorski, The Mathematics of Metamathematics, Warszawa, PWN 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Konikowska, B. A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic. Studia Logica 49, 541–555 (1990). https://doi.org/10.1007/BF00370164
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00370164