TY -
GEN
AU - Heusch, Peter
TI -
Lecture Notes in Computer Science: The complexity of the falsifiability problem for pure implicational formulas
PB - Springer Berlin Heidelberg
SN - 0302-9743
SN - 1611-3349
PY - 1995
UR - http://slubdd.de/katalog?TN_libero_mab2
ER -