Complexity of deductions in a system of classical propositional calculus

MaRDI QIDQ5942588zbMATH OpenFDO

Authors A. A. Chubaryan

Publication date 4 December 2001

Published in Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences (Search for Journal in Brave)

zbMATH Keywords

classical propositional logiccomplete axiom systemcomplexity of proofstautology

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 3954903
• scientific article; zbMATH DE number 3313427
• The Complexity of Propositional Proofs with the Substitution Rule
• Relative efficiency of a proof system for classical propositional logic
• scientific article; zbMATH DE number 1390276

Cited in

(5)

• The complexity of Gentzen systems for propositional logic
• Reasoning processes in propositional logic
• scientific article; zbMATH DE number 3954903 (Why is no real title available?)
• Definition of strong equality of tautologies and universal system for various propositional logics.
• Complexity of subclasses of the intuitionistic propositional calculus

This page was built for publication: Complexity of deductions in a system of classical propositional calculus

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