On the Computational Intractability of Analytic Tableau Methods

DOI10.1093/JIGPAL/2.2.205zbMath0810.03008OpenAlexW2327023354MaRDI QIDQ4318171

Erik Rosenthal, Neil V. Murray

Publication date: 2 January 1995

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

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

zbMATH Keywords

computational complexityintractabilityanalytic tableauxpath dissolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (2)

The complexity of analytic tableaux ⋮ The proof complexity of analytic and clausal tableaux

This page was built for publication: On the Computational Intractability of Analytic Tableau Methods