Skip Navigation



Logic Journal of IGPL Advance Access published online on September 18, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp053
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cowen, R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Generalized Davis-Putnam and satisfiability problems in mathematics

Robert Cowen

Department of Mathematics, Queens College, CUNY.
E-mail: robert.cowen{at}gmail.com


  Abstract

The well-known Davis-Putnam Procedure used to decide the Sat Problem in Logic is shown to be combinatorial in nature and thus directly applicable to solving various Mathematical "Satisfiability" Problems.

Key Words: Davis-Putnam • satisfiability

Received for publication 9 July 2009.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.