Proof Complexity Generators (London Mathematical Society Lecture Note Series)
55,05 €
The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory.
Jetzt bei Ebay:
