Soha Safwat Labib Hanna <br/><br/>
Descriptive complexitics of syntactical fragments of programming languages /  
 التعقيدات الوصفية للعبارات التركيبية الخاصة بلغات البرمجة 
Soha Safwat Labib Hanna ; Supervised Ibrahim Farag , Wafik Boulos Lotfallah 
 - Cairo :   Soha Safwat Labib Hanna ,   2012 
 - 91 Leaves ;   30cm 
<br/><br/>Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Computer Science 
<br/><br/> Descriptive complexitics emerged from finite model theory and had its aims in finding logics that capture computational complexity classes. Observing that imperative programming languages can also be considered as logics (maybe with some additional control), we wxtend the scope of descriptive complexity by defining two fragments of such languages and showing that they capture the classes P and NP 
<br/><br/>
<br/><br/><label>Subjects--Index Terms: </label>Descriptive complexitics Programming languages Syntactical fragments