Verwandte Artikel zu On Some Systems for Two Versions of Many-valued Logics
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Biografía del autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 23,90
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für On Some Systems for Two Versions of Many-valued Logics
Foto des Verkäufers
On Some Systems for Two Versions of Many-valued Logics
Verlag:
LAP LAMBERT Academic Publishing Aug 2017, 2017
ISBN 10: 6202011041
ISBN 13: 9786202011044
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. 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. Artikel-Nr. 9786202011044
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
On Some Systems for Two Versions of Many-valued Logics
Verlag:
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 6202011041
ISBN 13: 9786202011044
Neu
Paperback
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 80 pages. 8.66x5.91x0.19 inches. In Stock. Artikel-Nr. zk6202011041
Anzahl: 1 verfügbar