Media type: E-Article Title: Lecture Notes in Computer Science: The complexity of the falsifiability problem for pure implicational formulas Contributor: Heusch, Peter imprint: Springer Berlin Heidelberg, 1995 Published in: Lecture Notes in Computer Science Language: Not determined DOI: 10.1007/3-540-60246-1_128 ISSN: 0302-9743; 1611-3349 Origination: Footnote: