1. James Garson. Quantification in Modal Logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, pages 4 v.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1984.
   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, philosophy, model theory, honours reading.
   

   @InCollection{Garson1984,
   author = "James Garson",
   title = "Quantification in Modal Logic",
   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",
   pages = "4 v.",
   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, philosophy, model theory, honours reading",
   year = "1984",
   
   }
   

1. Leslie Lamport and Michael Fischer. Byzantine Generals and transaction commit protocols. Technical report Op. 62, SRI International and Yale University, 1984.
   Keywords: honours reading, coordination, agent communication languagess, algorithms.
   
   

   Abstract:

   "The transaction commit problem in a distributed database system is an instance of the Weak Byzantine Generals problem. It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays. Under this same assumption, a simple solution that exhibits the optimal worst-case behavior is given."

   
   

   @TechReport{Lamport1984,
   author = "Leslie Lamport and Michael Fischer",
   title = "Byzantine Generals and transaction commit protocols",
   institution = "SRI International and Yale University",
   number = "Op. 62",
   abstract = "The transaction commit problem in a distributed database system is an instance of the Weak Byzantine Generals problem. It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays. Under this same assumption, a simple solution that exhibits the optimal worst-case behavior is given.",
   keywords = "honours reading, coordination, agent communication languagess, algorithms",
   year = "1984",
   
   }
   

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.