Propositional proof compressions and DNF logic

DOI10.1093/JIGPAL/JZQ003zbMath1214.03044OpenAlexW2063200450MaRDI QIDQ3081241

No author found.

Publication date: 7 March 2011

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzq003

zbMATH Keywords

proof theorypropositional complexitydag-like derivability

Mathematics Subject Classification ID

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

Related Items (1)

Proof compression and NP versus PSPACE

This page was built for publication: Propositional proof compressions and DNF logic