Shortening proofs by quantifier introduction

DOI10.1007/BFB0013057MaRDI QIDQ4255508zbMATH OpenFDO

Authors Uwe Egly

Publication date 16 August 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0013057

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Recommendations

• A Resolution Calculus for Shortening Proofs
• scientific article; zbMATH DE number 517073
• scientific article; zbMATH DE number 516991
• Short proofs for tricky formulas
• On Stronger Calculi for QBFs

Cited in

(5)

• Short proofs in QBF expansion
• scientific article; zbMATH DE number 517073 (Why is no real title available?)
• Are Short Proofs Narrow? QBF Resolution Is Not So Simple
• Unsound inferences make proofs shorter
• A Resolution Calculus for Shortening Proofs

This page was built for publication: Shortening proofs by quantifier introduction

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