Switch to: References

Add citations

You must login to add citations.
  1. Strong Completeness Theorems for Weak Logics of Common Belief.Lismont Luc & Mongin Philippe - 2003 - Journal of Philosophical Logic 32 (2):115-137.
    We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Epistemic Structure of a Theory of a Game.Michael Bacharach - 1994 - Theory and Decision 37 (1):7-48.
  • Representing the Knowledge of Turing Machines.Hyun Song Shin & Timothy Williamson - 1994 - Theory and Decision 37 (1):125-146.
  • Dynamic Epistemic Logic I: Modeling Knowledge and Belief.Eric Pacuit - 2013 - Philosophy Compass 8 (9):798-814.
    Dynamic epistemic logic, broadly conceived, is the study of logics of information change. This is the first paper in a two-part series introducing this research area. In this paper, I introduce the basic logical systems for reasoning about the knowledge and beliefs of a group of agents.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Reasoning-Based Introspection.Olivier Gossner & Elias Tsakas - 2012 - Theory and Decision 73 (4):513-523.
    We show that if an agent reasons according to standard inference rules, the truth and introspection axioms extend from the set of non-epistemic propositions to the whole set of propositions. This implies that the usual axiomatization of partitional possibility correspondences is redundant, and provides a justification for truth and introspection that is partly based on reasoning.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Game Logic and its Applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
    This paper provides a logic framework for investigations of game theoretical problems. We adopt an infinitary extension of classical predicate logic as the base logic of the framework. The reason for an infinitary extension is to express the common knowledge concept explicitly. Depending upon the choice of axioms on the knowledge operators, there is a hierarchy of logics. The limit case is an infinitary predicate extension of modal propositional logic KD4, and is of special interest in applications. In Part I, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Sound Interpretation of Minimality Properties of Common Belief in Minimal Semantics.Vittoriomanuele Ferrante - 1996 - Theory and Decision 41 (2):179-185.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Iterative and Fixed Point Common Belief.Aviad Heifetz - 1999 - Journal of Philosophical Logic 28 (1):61-79.
    We define infinitary extensions to classical epistemic logic systems, and add also a common belief modality, axiomatized in a finitary, fixed-point manner. In the infinitary K system, common belief turns to be provably equivalent to the conjunction of all the finite levels of mutual belief. In contrast, in the infinitary monotonic system, common belief implies every transfinite level of mutual belief but is never implied by it. We conclude that the fixed-point notion of common belief is more powerful than the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Awareness and Partitional Information Structures.Salvatore Modica & Aldo Rustichini - 1994 - Theory and Decision 37 (1):107-124.
  • Common Knowledge Logic and Game Logic.Mamoru Kaneko - 1999 - Journal of Symbolic Logic 64 (2):685-700.
    We show the faithful embedding of common knowledge logic CKL into game logic GL, that is, CKL is embedded into GL and GL is a conservative extension of the fragment obtained by this embedding. Then many results in GL are available in CKL, and vice versa. For example, an epistemic consideration of Nash equilibrium for a game with pure strategies in GL is carried over to CKL. Another important application is to obtain a Gentzen-style sequent calculus formulation of CKL and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the Logic of Common Belief.Giacomo Bonanno - 1996 - Mathematical Logic Quarterly 42 (1):305-311.
    We investigate an axiomatization of the notion of common belief that makes use of no rules of inference and highlight the property of the set of accessibility relations that characterizes each axiom.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations