An algorithm of classification of unranked propositional logic formulas

MaRDI QIDQ2850400zbMATH OpenFDO

Authors Kh. M. Rukhaia, L. M. Tibua, G. O. Chankvetadze, G. M. Mikhanadze

Publication date 26 September 2013

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

classification of formulasdirective operatorpropositional logicunranked logic

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• The algorithmic problem of finitary semantic consequence for propositional formulas. I: Context and problem formulation
• Determination of the class of validity of logical formulas by directed exhaustive search
• scientific article; zbMATH DE number 702472
• scientific article; zbMATH DE number 4145871
• scientific article; zbMATH DE number 4039849

Cited in

(7)

• An algorithm for deriving tautologies of logic of classes and relations from those of sentential calculus
• An eighteen-classification partition of the propositional formula set F(S) based on a revised Gödel operator
• scientific article; zbMATH DE number 3864540 (Why is no real title available?)
• scientific article; zbMATH DE number 4147493 (Why is no real title available?)
• scientific article; zbMATH DE number 4039849 (Why is no real title available?)
• The algorithmic problem of finitary semantic consequence for propositional formulas. I: Context and problem formulation
• Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas

This page was built for publication: An algorithm of classification of unranked propositional logic formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850400)