The complexity of analytic tableaux
From MaRDI portal
Recommendations
- The complexity of analytic tableaux
- The proof complexity of analytic and clausal tableaux
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- On the Computational Intractability of Analytic Tableau Methods
- The expected complexity of analytic tableaux analyses in propositional calculus. II
Cites work
Cited in
(13)- On the relative merits of path dissolution and the method of analytic tableaux
- The expected complexity of analytic tableaux analyses in propositional calculus. II
- The proof complexity of analytic and clausal tableaux
- Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)
- A bibliography on analytic tableaux theorem proving
- scientific article; zbMATH DE number 440107 (Why is no real title available?)
- scientific article; zbMATH DE number 3934720 (Why is no real title available?)
- scientific article; zbMATH DE number 638364 (Why is no real title available?)
- On the Computational Intractability of Analytic Tableau Methods
- scientific article; zbMATH DE number 1552522 (Why is no real title available?)
- The complexity of analytic tableaux
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Tableau complexes
This page was built for publication: The complexity of analytic tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3410672)