1. Melvin Fitting. Proof methods for modal and intuitionistic logics, Synthese library ; v. 169.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Boston, Dordrecht, Holland ; Boston, U.S.A. Hingham, MA, 1983.
   Note: Melvin Fitting. Includes index. Bibliography: p. 526-539.
   Keywords: modal logic, proof theory, model theory, honours reading.
   

   @Book{Fitting1983,
   author = "Melvin Fitting",
   title = "Proof methods for modal and intuitionistic logics",
   publisher = "D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Boston",
   address = "Dordrecht, Holland ; Boston, U.S.A. Hingham, MA",
   series = "Synthese library ; v. 169.",
   note = "Melvin Fitting. Includes index. Bibliography: p. 526-539.",
   keywords = "modal logic, proof theory, model theory, honours reading",
   year = "1983",
   
   }
   




2. Ehud Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
   Keywords: logic programming, inductive logic programming, honours reading.
   

   @Book{Shapiro1983,
   author = "Ehud Y. Shapiro",
   title = "Algorithmic Program Debugging",
   publisher = "MIT Press",
   keywords = "logic programming, inductive logic programming, honours reading",
   year = "1983",
   
   }
   




3. Dov M. Gabbay and Franz Guenthner, editors. Handbook of philosophical logic, Synthese library ; v. 164-167.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1983.
   Note: Edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.
   Keywords: modal logic, epistemic logic, honours reading.
   

   @Book{Gabbay1983,
   editor = "Dov M. Gabbay and Franz Guenthner",
   title = "Handbook of philosophical logic",
   publisher = "D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers",
   address = "Dordrecht ; Boston Hingham, MA",
   series = "Synthese library ; v. 164-167.",
   note = "edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.",
   keywords = "modal logic, epistemic logic, honours reading",
   year = "1983",
   
   }
   

1. Johan van Benthem. Correspondence Theory. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 4, pages 162--167. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1983.
   Note: Edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.
   Keywords: modal logic, epistemic logic, honours reading.
   

   @InCollection{van_Benthem1983,
   author = "Johan van Benthem",
   title = "Correspondence Theory",
   booktitle = "Handbook of philosophical logic",
   editor = "Dov M. Gabbay and Franz Guenthner",
   publisher = "D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers",
   address = "Dordrecht ; Boston Hingham, MA",
   volume = "4",
   pages = "162--167",
   note = "edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.",
   keywords = "modal logic, epistemic logic, honours reading",
   year = "1983",
   
   }
   

1. Neil Immerman. Languages Which Capture Complexity Classes. In 15th ACM STOC Symposium, pages 347--354, 1983.
   Keywords: computational complexity, honours reading. [download paper ]
   

   @InProceedings{Immerman1983,
   author = "Neil Immerman",
   title = "Languages Which Capture Complexity Classes",
   booktitle = "15th ACM STOC Symposium",
   pages = "347--354",
   URL = "http://www.cs.umass.edu/~immerman/pub/capture.pdf",
   keywords = "computational complexity, honours reading",
   year = "1983",
   
   }
   

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.