Searching for "Structures in Logic and Computer Science" – sorted by Relevance.
-
The Complexity of the Falsifiability Problem for Pure Implicational Formulas
- satisfiability). Subject classification: algorithms and data structures, logic in computer science. 1
- Cited by 4 (1 self) – Add To MetaCart
-
Information Flow and Relevant Logics
- in logic, computer science and information theory can each be seen as models of information flow. We
- Cited by 5 (3 self) – Add To MetaCart
-
Bibliography
- words, In Mycielski, J., Rozenberg, G., and Salomaa, A. (Eds.), Structures in Logic and Computer Science
- Add To MetaCart

