Games, norms and reasons: logic at the crossroads

Preface.- Dedication.- 1. Bounded Rationality: Models for some Fast and Frugal Heuristics Horacio Arlo-Costa and Arthur Paul Pedersen.- 2. Why Do We Need Justification Logic? Sergei Artemov.- 3. Why Meanings are Not Normative Akeel Bilgrami.- 4. The Realization Theorem for S5: A Simple, Constructive Proof Melvin Fitting.- 5. Merging Information Sujata Ghosh and Fernando R. Velazquez-Quesada.- 6. Modal Logic for Lexicographic Preference Aggregation Patrick Girard.- 7. No-PHI-Regret: A Connection between Computational Learning Theory and Game Theory Amy Greenwald, Amir Jafari and Casey Marks.- 8. Axioms of Distinction in Social Software Vincent F. Hendricks.- 9. Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management Dexter Kozen and Ganesh Ramanarayanan.- 10. Generalizing Parikh's Theorem Johann A. Makowsky.- 11. Syllogistic Logic with Complements Lawrence Moss.- 12. From Unary to Binary Inductive Logic Jeff Paris and Alena Vencovska.- 13. Challenges for Decidable Epistemic Logics from Security Protocols R. Ramanujam and S.P. Suresh.

[1]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Mads Dam,et al.  A Complete Axiomatization of Knowledge and Cryptography , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[3]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[4]  Ramaswamy Ramanujam,et al.  Decidability of context-explicit security protocols , 2005, J. Comput. Secur..

[5]  Michaël Rusinowitch,et al.  Protocol insecurity with a finite number of sessions, composed keys is NP-complete , 2003, Theor. Comput. Sci..

[6]  Ramaswamy Ramanujam,et al.  Knowledge-based modelling of voting protocols , 2007, TARK '07.

[7]  Oded Goldreich,et al.  On the security of multi-party ping-pong protocols , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  S. P. Suresh.  Foundations of Security Protocol Analysis , 2003 .

[9]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Rohit Parikh.  Logical omniscience and common knowledge: WHAT do we know and what do WE know? , 2005, TARK.

[11]  Ross J. Anderson,et al.  Programming Satan's Computer , 1995, Computer Science Today.

[12]  Dan M. Nessett,et al.  A critique of the Burrows, Abadi and Needham logic , 1990, OPSR.

[13]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[14]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[15]  Joseph Y. Halpern,et al.  Modeling Adversaries in a Logic for Security Protocol Analysis , 2006, FASec.

[16]  Thomas Wilke,et al.  Preservation of epistemic properties in security protocol implementations , 2007, TARK '07.

[17]  Paul F. Syverson,et al.  On unifying some cryptographic protocol logics , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.