A method for the synthesis of deducibility conditions for Horn and some other formulas

DOI10.1007/BF02673030zbMath1042.03527MaRDI QIDQ1847304

S. N. Vasil'ev

Publication date: 6 January 2004

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35)

Related Items (4)

Complexity of the problem of being equivalent to Horn formulas ⋮ Verification of the logical sequence in nonclassical multivalued logic ⋮ Complexity of the problem of being equivalent to Horn formulas. II ⋮ Automation methods for logical derivation and their application in the control of dynamic and intelligent systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculus of standard quantor formulas
• Toward Mechanical Mathematics
• Machine synthesis of mathematical theorems
• A Machine-Oriented Logic Based on the Resolution Principle
• On sentences which are true of direct unions of algebras

This page was built for publication: A method for the synthesis of deducibility conditions for Horn and some other formulas