Abstract
The expressive power of 2-cnfs, conjunctive normal forms with two literals per clause, is shown to be severely limited compared to 3-cnfs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bagchi A., Servatius B., Shi W. (1995) ‘2-satisfiability and diagnosing faulty processors in massively parallel computing systems’. Discrete Applied Math. 60: 25–37
Cowen R. (1990) ‘Two hypergraph theorems equivalent to BPI’. Notre Dame J. Formal Logic 31: 232–239
Garey, M.R., and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
West D.B. (1996) Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, N.J.
Wojtylak, P., ‘2-SAT is not equivalent to the Boolean Prime Ideal Theorem’, in Ewa Orłowska (ed.), Logic at Work, Essays Dedicated to the Memory of Helena Rasiowa, Springer-Verlag, 1998, pp. 580–583.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cowen, R. 2-CNFS and Logical Embeddings. Stud Logica 93, 15–19 (2009). https://doi.org/10.1007/s11225-009-9206-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-009-9206-1