On Some Systems for Two Versions of Many-valued Logics

Anahit Chubaryan

ISBN 10: 6202011041 / ISBN 13: 9786202011044

Published by LAP LAMBERT Academic Publishing Aug 2017, 2017

About this Item

Neuware -The current research refers to the problem of constructing several proof systems for two versions of many-valued propositional logic and investigating of their properties . The generalization of Kalmar¿s proof of deducibility for two-valued tautologies in the classical propositional logic gives us a possibility to suggest 1) a new method of proving the completeness of propositional proof system of three-valued logic of Lukasewicz that it is essentially simpler than other known proofs of completeness and can be easily modified into a proof of completeness for other versions of k-valued logics for k¿3 and even for fuzzy logic as well, 2) a method of defining many traditional variants of proof systems for k-valued (k¿3) logics, the completeness of which is easily proved directly, without the usual immersion into two-valued logic. Most of all the introduced proof systems are ¿weak¿ ones with a ¿simple strategist¿ of proof search and we have also investigated the quantitative properties, related to proof complexity characteristics in them.Books on Demand GmbH, Überseering 33, 22297 Hamburg 80 pp. Englisch.

Seller Inventory # 9786202011044

Bibliographic Details

• Title: On Some Systems for Two Versions of Many-valued Logics
• Publisher: LAP LAMBERT Academic Publishing Aug 2017
• Publication Date: 2017
• Language: English
• ISBN 10: 6202011041
• ISBN 13: 9786202011044
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 137 grams

About this title

Synopsis

The current research refers to the problem of constructing several proof systems for two versions of many-valued propositional logic and investigating of their properties . The generalization of Kalmar’s proof of deducibility for two-valued tautologies in the classical propositional logic gives us a possibility to suggest 1) a new method of proving the completeness of propositional proof system of three-valued logic of Lukasewicz that it is essentially simpler than other known proofs of completeness and can be easily modified into a proof of completeness for other versions of k-valued logics for k≥3 and even for fuzzy logic as well, 2) a method of defining many traditional variants of proof systems for k-valued (k≥3) logics, the completeness of which is easily proved directly, without the usual immersion into two-valued logic. Most of all the introduced proof systems are “weak” ones with a “simple strategist” of proof search and we have also investigated the quantitative properties, related to proof complexity characteristics in them.

About the Author

Anahit A. Chubaryan, Doctor of Sciences, Professor of Mathematics, Full Professor of Department of Informatics and Applied Mathematics, Yerevan State University and Russian-Armenian University. Subjects: Mathematical Logic, Common Theory of Complexity, Proof Complexity. Major fields: Proof Complexity, Systems of nonclassical and many-valued Logics.