The expected complexity of analytic tableaux analyses in propositional calculus

DOI10.1305/NDJFL/1093870153MaRDI QIDQ1168964zbMATH OpenOpenAlexFDO

Authors J. M. Plotkin, John W. Rosenthal

Publication date 1982

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093870153

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cited in

(1)

• The expected complexity of analytic tableaux analyses in propositional calculus. II

This page was built for publication: The expected complexity of analytic tableaux analyses in propositional calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168964)