1 Introduction  
2 Definitions  
3 Background: Duality and the Classes NP and CoNP  
4 Lack of Strong Duality Results in NP Hardness  
5 Does Strong Duality Imply Polynomial Time Solvability?  
6 Descriptive Complexity and Fixed Points  
7 Conclusion and Further Study