PROOF COMPLEXITIES ON A CLASS OF BALANCED FORMULAS IN SOME PROPOSITIONAL SYSTEMS

DOI10.46991/PYSU:A/2022.56.2.058MaRDI QIDQ5883729zbMATH OpenWikidataFDO

Authors A. A. Chubaryan

Publication date 22 March 2023

Published in Proceedings of the YSU A: Physical and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/uzeru974

zbMATH Keywords

balanced tautologieselimination systemgeneralized splitting systemproof complexity characteristics

Mathematics Subject Classification ID

Structure of proofs (03F07) Complexity of proofs (03F20)

Recommendations

• On proof normal forms for some systems of classical propositional logic
• Proof theory
• scientific article; zbMATH DE number 6387509
• The Complexity of Propositional Proofs
• Relative efficiency of a proof system for classical propositional logic

Cites work

• Extension without cut
• Relative efficiency of a proof system for classical propositional logic
• The relative efficiency of propositional proof systems

Cited in

(1)

• scientific article; zbMATH DE number 1678364 (Why is no real title available?)

This page was built for publication: PROOF COMPLEXITIES ON A CLASS OF BALANCED FORMULAS IN SOME PROPOSITIONAL SYSTEMS

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