Understanding Gentzen and Frege Systems for QBF

DOI10.1145/2933575.2933597zbMath1395.03028OpenAlexW2339728308WikidataQ59893132 ScholiaQ59893132MaRDI QIDQ4635870

Ján Pich, Olaf Beyersdorff

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/98002/1/Gentzen-Frege.pdf

zbMATH Keywords

sequent calculussimulationslower boundsintuitionistic logicFrege systemsstrategy extractionQBF proof systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (9)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ Lower Bound Techniques for QBF Proof Systems ⋮ Unnamed Item ⋮ A game characterisation of tree-like Q-resolution size ⋮ Characterising tree-like Frege proofs for QBF ⋮ Understanding cutting planes for QBFs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Understanding Gentzen and Frege Systems for QBF