caa a22 4500 465779344 CHVBK 20180323111951.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF00370164 doi (NATIONALLICENCE)springer-10.1007/BF00370164 Konikowska Beata Institute of Computer Science Polish Academy of Sciences, P. O. Box 22, 00-901, Warsaw, Poland aut A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic [Elektronische Daten] [Beata Konikowska] 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. Polish Academy of Sciences, 1990 Studia Logica Kluwer Academic Publishers 49/4(1990-12-01), 541-555 0039-3215 49:4<541 1990 49 11225 https://doi.org/10.1007/BF00370164 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00370164 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Konikowska Beata Institute of Computer Science Polish Academy of Sciences, P. O. Box 22, 00-901, Warsaw, Poland aut NATIONALLICENCE 773 0- Studia Logica Kluwer Academic Publishers 49/4(1990-12-01), 541-555 0039-3215 49:4<541 1990 49 11225 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer