scientific article; zbMATH DE number 1156870
From MaRDI portal
Publication:4390867
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited in
(20)- The complexity of Gentzen systems for propositional logic
- The treewidth of proofs
- Expansion-based QBF solving versus Q-resolution
- The universe of propositional approximations
- On the complexity of the reflected logic of proofs
- Expressing versus proving: relating forms of complexity in logic
- On the complexity of proof deskolemization
- Proof Complexity and the Kneser-Lovász Theorem
- Twelve Problems in Proof Complexity
- scientific article; zbMATH DE number 1342249 (Why is no real title available?)
- scientific article; zbMATH DE number 4114609 (Why is no real title available?)
- scientific article; zbMATH DE number 1860652 (Why is no real title available?)
- A Logical Autobiography
- Substitution and Propositional Proof Complexity
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH
- scientific article; zbMATH DE number 2212138 (Why is no real title available?)
- A note on the complexity of propositional Hoare logic
- Complexity of Null- and Positivstellensatz proofs
- Proof complexity of modal resolution
- On meta complexity of propositional formulas and propositional proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390867)
