The Satisfiability Problem
Elsevier (1999)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Propositional calculus Decision making Computer algorithms Algebra, Boolean | |||||||||
| Categories | ||||||||||
| Buy the book | $275.16 new (16% off) $325.00 direct from Amazon $391.57 used Amazon page | |||||||||
| Call number | QA9.3.S37 1999 | |||||||||
| ISBN(s) | 0444504109 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesAdam Kolany (1997). Consequence Operations Based on Hypergraph Satisfiability. Studia Logica 58 (2):261-272.
Ian Pratt-Hartmann (2008). On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. The Bulletin of Symbolic Logic 14 (1):1 - 28.
Rod Downey & Carl G. Jockusch Jr (1999). Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank. Journal of Symbolic Logic 64 (1):45-52.
Sakaé Fuchino (1994). Some Remarks on Openly Generated Boolean Algebras. Journal of Symbolic Logic 59 (1):302-310.
Lars Hansen (2005). On an Algebra of Lattice-Valued Logic. Journal of Symbolic Logic 70 (1):282 - 318.
Hugues Leblanc (1962). Boolean Algebra and the Propositional Calculus. Mind 71 (283):383-386.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
