Consistency checking is NP-complete
That's a pretty strong claim. Is there a proof? Or did you just mean that consistency checking is in NP?
Well, 3-SAT is NP-complete, anyway. If consistency checking in mere propositional logic is already NP-complete, then it can't be any easier to do consistency checking to real-world arguments that require predicate logic or other, even more complicated systems to express.
Godel Escher Bach has a section that talks about this.
A monthly thread for posting any interesting rationality-related quotes you've seen recently on the Internet, or had stored in your quotesfile for ages.