Searching for "The Complexity of the Falsifiability Problem for Pure Implicational Formulas." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

The Complexity of the Falsifiability Problem for Pure Implicational Formulas
by Peter Heusch, Peter Heusch — 1995 — Proc. 20th Int'l Symposium on Mathematical Foundations of Computer Science (MFCS'95), J. Wiedermann, P. Hajek (Eds.), Prague, Czech Republic. Lecture Notes in Computer Science (LNCS 969
… of the Falsifiability Problem for Pure Implicational Formulas by P. Heusch 1995 Accepted for MFCS'95 Institut fur…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB