Switch to: References

Add citations

You must login to add citations.
  1. Generalized Quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
  • AGM Belief Revision in Dynamic Games.Giacomo Bonanno - 2011 - In Krzysztof Apt (ed.), Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XIII).
    Within the context of extensive-form (or dynamic) games, we use choice frames to represent the initial beliefs of a player as well as her disposition to change those beliefs when she learns that an information set of hers has been reached. As shown in [5], in order for the revision operation to be consistent with the AGM postulates [1], the player’s choice frame must be rationalizable in terms of a total pre-order on the set of histories. We consider four properties (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Merging Frameworks for Interaction.Johan van Benthem, Jelle Gerbrandy, Tomohiro Hoshi & Eric Pacuit - 2009 - Journal of Philosophical Logic 38 (5):491-526.
    A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   39 citations  
  • Thompson Transformations for If-Logic.Francien Dechesne - 2006 - Synthese 149 (2):285-309.
    In this paper we study connections between game theoretical concepts and results, and features of IF-predicate logic, extending observations from J. van Benthem (2001) for IF-propositional logic. We highlight how both characteristics of perfect recall can fail in the semantic games for IF-formulas, and we discuss the four Thompson transformations in relation with IF-logic. Many (strong) equivalence schemes for IF-logic correspond to one or more of the transformations. However, we also find one equivalence that does not fit in this picture, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations