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

DOI10.46991/PYSU:A/2022.56.2.058WikidataQ113691238 ScholiaQ113691238MaRDI QIDQ5883729

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)

Cites Work

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

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