Towards feasible solutions of the tautology problem

DOI10.1016/0003-4843(76)90020-6zbMath0349.02006OpenAlexW4210729208WikidataQ111333805 ScholiaQ111333805MaRDI QIDQ4119174

Hao Wang, Bradford Dunham

Publication date: 1976

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(76)90020-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05)

Related Items

Simulating circuit-level simplifications on CNF, Spring Meeting of the Association for Symbolic Logic, San Francisco, 1991, Tautology testing with a generalized matrix reduction method, Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation, Some hard examples for the resolution method, The linked conjunct method for automatic deduction and related search techniques, Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence