Skip to main content
SpringerLink
Log in

Computation as Conversation

  • Chapter
New Computational Paradigms

  • 1339 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky S. (2006) Information, Processes, and Games. To appear in Adriaans P., van Benthem J. (eds.), Handbook of the Philosophy of Information. Elsevier Science Publishers, Amsterdam

    Google Scholar 

  2. Abramsky S., Coecke B. (2004) A Categorical Semantics of Quantum Protocols. In Proceedings of the 19th Annual IEEE Symposium on Logic in Com-puter Science (LiCS ‘04), IEEE Computer Science Press

    Google Scholar 

  3. Baltag A., Moss L., Solecki S. (1998) The Logic of Public Announce-ments, Common Knowledge and Private Suspicions. In Proceedings TARK 1998, Morgan Kaufmann Publishers, Los Altos, 43-56

    Google Scholar 

  4. Baltag A., Smets, S. (2004) The Logic of Quantum Programs. In Pro-ceedings of the 2nd International Workshop on Quantum Programming Languages, TUCS General Publication No 33, Turku Center for Computer Science. Extended version: LQP: The Dynamic Logic of Quantum Information. Oxford Computing Lab & Philosophy, Free University Brussels

    Google Scholar 

  5. Baltag A., Smets S. (2006) Dynamic Belief Revision over Multi-Agent Plausibility Models. In Proceedings LOFT 2006, Department of Computing, University of Liverpool

    Google Scholar 

  6. van Benthem J. (1996) Exploring Logical Dynamics. CSLI Publications, Stanford

    MATH  Google Scholar 

  7. van Benthem J. (1999) Logic in Games. Lecture Notes, ILLC Amsterdam

    Google Scholar 

  8. van Benthem J. (2001) Games in Dynamic Epistemic Logic. In Bo-nanno G., van der Hoek W. (eds.) Bulletin of Economic Research, 53:4, 219-248

    Google Scholar 

  9. van Benthem J. (2005) An Essay on Sabotage and Obstruction. In D. Hutter (ed.), Mechanizing Mathematical Reasoning, Essays in Honor of Jörg Siekmann on the Occasion of his 69th Birthday. Springer, LNCS, 2605:268-276

    Google Scholar 

  10. van Benthem J. (2005) Open Problems in Logic and Games. In Arte-mov S., Barringer H., d’Avila Garcez A., Lamb L., Woods J. (eds.) Essays in Honour of Dov Gabbay. King’s College Publications, London, 229-264

    Google Scholar 

  11. van Benthem J. (2006) Dynamic Logic of Belief Revision. ILLC Tech Report, DARE electronic archive, University of Amsterdam. To appear in J. Applied Non-Classical Logics

    Google Scholar 

  12. van Benthem J. (2006) Living With Rational Animals. Invited Lecture at Workshop on Knowledge and Rationality, 18th ESSLLI Summer School, Malaga

    Google Scholar 

  13. van Benthem J. (2006) One is a Lonely Number: On the Logic of Communication. In: Chatzidakis Z., Koepke P., Pohlers W. (eds.) Logic Colloquium ’02. ASL and A.K. Peters, Wellesley MA, 96-129

    Google Scholar 

  14. van Benthem J. (2006) Open Problems in Update Logic. In Gabbay D., Goncharov S., Zakharyashev M. (eds.) Mathematical Problems from Applied Logic I. Springer, New York, Novosibirsk, 137-192

    Chapter  Google Scholar 

  15. Rationalizations and Promises in Games. Bejing Philosphical Review, Chinese Academy of Social Sciences

    Google Scholar 

  16. van Benthem J., van Eijck J., Kooi B. (2005) A Logic for Commu-nication and Change. ILLC & CWI Amsterdam & philosophy department, Groningen. First version in van der Meijden R. et al. (eds.) Proceedings TARK 2005, Singapore. Extended version in: Inform. and Comput. 2006

    Google Scholar 

  17. van Benthem J., Blackburn P. (2006) Modal Logic: A Se-mantic Perspective. Tech Report, ILLC, Amsterdam. In: Blackburn P., van Benthem J., Wolter F. (eds.) Handbook of Modal Logic. Elsevier, Amsterdam, 2007

    Google Scholar 

  18. van Benthem J., Liu F. (2004) Diversity of Logical Agents in Games. Philosophia Scientiae 8:2, 163-178

    Google Scholar 

  19. van Benthem J., Liu F. (2005) Dynamic Logic of Preference Up-grade. ILLC Tech Report, DARE electronic archive, University of Amsterdam. To appear in: J. Applied Non-Classical Logics

    Google Scholar 

  20. van Benthem J., Pacuit E. (2006) The Tree of Knowledge in Action. Tech Report, ILLC Amsterdam. In: Proceedings AiML 2006, Melbourne

    Google Scholar 

  21. Brafman R., Latombe J-C, Shoham Y. (1993) Towards Knowledge-Level Analysis of Motion Planning. Proceedings AAAI 1993, 670-675

    Google Scholar 

  22. Condon A. (1988) Computational Models of Games. PhD Thesis. Computer Science Department, University of Washington

    Google Scholar 

  23. Dechesne F., Wang Y. (2007) Dynamic Epistemic Verification of Security Protocols. In van Benthem J., Ju S., Veltman F. (eds.) A Meeting of the Minds. Proceedings LORI, Bejing 2007. College Publications, London, 129-143

    Google Scholar 

  24. van Ditmarsch H. (2002) Keeping Secrets with Public Communication. Department of Computer Science. University of Otago

    Google Scholar 

  25. van Emde Boas P. (2002) Models for Games and Complexity. Lecture Notes. ILLC, Amsterdam

    Google Scholar 

  26. Fagin R., Halpern J., Moses Y., Vardi M. (1995) Reasoning about Knowl-edge. MIT Press, Cambridge (Mass.)

    Google Scholar 

  27. Gerbrandy J. (1999) Bisimulations on Planet Kripke. Dissertation DS-1999-01. Institute for Logic, Language and Computation. University of Amsterdam

    Google Scholar 

  28. Gigerenzer G., Todd P. M., ABC Research Group (1999) Simple Heuristics That Make Us Smart. Oxford University Press

    Google Scholar 

  29. Greenlaw R., Hoover H., Ruzzo W. (1991) A Compendium of Prob-lems Complete for P. University of Alberta, Computer Science Department, Technical Re-port 91-11

    Google Scholar 

  30. Halpern J., Vardi M. (1989) The Complexity of Reasoning about Knowledge and Time, I: lower bounds. J. Comput. System Sci., 38:1, 195-237

    Article  MATH  MathSciNet  Google Scholar 

  31. Hintikka J. (1962) Knowledge and Belief. Cornell University Press, Ithaca

    Google Scholar 

  32. Hintikka J., Sandu G. (1997) Game-Theoretical Semantics, In van Benthem J., ter Meulen A. (eds.) Handbook of Logic and Language, Elsevier, Amsterdam, 361-410.

    Chapter  Google Scholar 

  33. Kozen D., Harel D., Tiuryn J. (2000) Dynamic Logic. MIT Press, Cam-bridge (Mass.)

    Google Scholar 

  34. Liu F. (2006) Diversity of Logical Agents. ILLC Research Report, University of Amsterdam. Presented at Workshop on Bounded Agents, ESSLLI Malaga 2006

    Google Scholar 

  35. Lutz C. (2005) Complexity and Succinctness of Public Announcement Logic. LTCS Report 05-09, Technical University Dresden

    Google Scholar 

  36. Marx M. (2006) Complexity of Modal Logics. To appear in Blackburn P., van Benthem J., Wolter F. (eds.) Handbook of Modal Logic. Elsevier, Amsterdam

    Google Scholar 

  37. Miller J., Moss L. (2005) The undecidability of iterated modal rela-tivization. Studia Logica, 79:3, 373-407

    Article  MATH  MathSciNet  Google Scholar 

  38. Osborne M., Rubinstein A. (1994) A Course in Game Theory. MIT Press, Cambridge (Mass.)

    Google Scholar 

  39. A Security Analysis of Multi-Agent Protocols. Dissertation. Department of Computing, University of Liverpool, & ILLC, University of Amsterdam, DS-2005-05

    Google Scholar 

  40. Papadimitriou C. (1994) Computational Complexity. Addison-Wesley

    Google Scholar 

  41. Parikh R. (2002) Social Software. Synthese 132:187-211

    MATH  MathSciNet  Google Scholar 

  42. Parikh R., Ramanujam R. (2003) A Knowledge Based Semantics of Messages. CUNY New York & Chennai, India. In van Benthem J., van Rooy R. (eds.) Special Issue on Information Theories, J. Logic Lang. Inform., 12:4, 453-467

    Google Scholar 

  43. Plaza J. (1989) Logics of Public Announcements. In Proceedings 4th Interna-tional Symposium on Methodologies for Intelligent Systems

    Google Scholar 

  44. Pratt V. (1976) Semantical Considerations on Floyd-Hoare Logic. In Proceedings 17th Ann. IEEE Symposium on Foundations of Computer Science, 109-121

    Google Scholar 

  45. Rahman S., Gabbay D., Van Bendegem J-P , Symons J. (2004) Logic, Epistemology, and the Unity of Science, Vol. I. Kluwer, Dordrecht

    Google Scholar 

  46. Reiter R. (2001) Knowledge in Action. MIT Press, Cambridge (Mass.)

    MATH  Google Scholar 

  47. Rohde Ph. (2005) On Games and Logics over Dynamically Changing Struc-tures. Dissertation. Rheinisch-Westfälische Technische Hochschule Aachen

    Google Scholar 

  48. Sevenster M. (2006) Branches of Imperfect Information: Logic, Games, and Computation. Dissertation DS-2006-06. ILLC Amsterdam

    Google Scholar 

  49. Turing A. M. (1950) Computing machinery and intelligence. Mind 59:433-460

    Article  MathSciNet  Google Scholar 

  50. Vardi M. (1997) Why is Modal Logic So Robustly Decidable?. In Immerman N., Kolaitis Ph. (eds.) Descriptive Complexity and Finite Models. American Mathematical Society

    Google Scholar 

  51. Yao A. C. (1979) Some Complexity Questions Related to Distributed Computing. In Proceedings of the 11th STOC, 209-213

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Stanford University, Stanford, CA, USA

    Johan van Benthem

Authors
  1. Johan van Benthem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, Netherlands

    Benedikt Löwe

  3. Università di Siena, Pian dei Mantellini 44, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

van Benthem, J. (2008). Computation as Conversation. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) New Computational Paradigms. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68546-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-68546-5_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-36033-1

  • Online ISBN: 978-0-387-68546-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation