Proof compressions with circuit-structured substitutions
From MaRDI portal
(Redirected from Publication:843604)
Recommendations
Cites work
- scientific article; zbMATH DE number 5910658 (Why is no real title available?)
- scientific article; zbMATH DE number 1179974 (Why is no real title available?)
- scientific article; zbMATH DE number 1526721 (Why is no real title available?)
- Finite investigations of transfinite derivations
- On cut elimination in the presence of perice rule
- Polynomial size proofs of the propositional pigeonhole principle
- The intractability of resolution
Cited in
(8)- Proof compression and NP versus PSPACE
- Exponentially huge natural deduction proofs are redundant: preliminary results on \(M_{\supset}\)
- A compact representation of proofs
- A Subatomic Proof System for Decision Trees
- On strong normalization in proof-graphs for propositional logic
- scientific article; zbMATH DE number 1552526 (Why is no real title available?)
- Proof compression and NP versus PSPACE. II
- Propositional proof compressions and DNF logic
This page was built for publication: Proof compressions with circuit-structured substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843604)