A quantitative analysis of modal logic

We do a quantitative analysis of modal logic. For example, for each Kripke structure M , we study the least ordinal μ such that for each state of M , the beliefs up to level μ characterize the agents' beliefs (that is, there is only one way to extend these beliefs to higher levels). As another example, we show the equivalence of three conditions, that on the face of it look quite different, for what it means to say that the agents' beliefs have a countable description, or putting it another way, have a “countable amount of information”. The first condition says that the beliefs of the agents are those at a state of a countable Kripke structure. The second condition says that the beliefs of the agents can be described in an infinitary language, where conjunctions of arbitrary countable sets of formulas are allowed. The third condition says that countably many levels of belief are sufficient to capture all of the uncertainty of the agents (along with a technical condition). The fact that all of these conditions are equivalent shows the robustness of the concept of the agents' beliefs having a “countable description”.

[1]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[2]  Wiebe van der Hoek On the Semantics of Graded Modalities , 1992, J. Appl. Non Class. Logics.

[3]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[4]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[5]  S. Zamir,et al.  Formulation of Bayesian analysis for games with incomplete information , 1985 .

[6]  Ronald Fagin,et al.  A model-theoretic analysis of knowledge , 1991, JACM.

[7]  J. Burgess Decidability for branching time , 1980 .

[8]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[9]  Kit Fine,et al.  Normal forms in modal logic , 1975, Notre Dame J. Formal Log..

[10]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[11]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[12]  Rohit Parikh Finite and Infinite Dialogues , 1992 .

[13]  J. C. Burkill,et al.  A mathematician's miscellany , 1954 .

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

[15]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[16]  Max J. Cresswell,et al.  A companion to modal logic , 1984 .

[17]  Maurizio Fattorosi-Barnaba,et al.  Graded modalities. I , 1985, Stud Logica.

[18]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[19]  Ronald Fagin,et al.  The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge , 1992, TARK.

[20]  Joseph Y. Halpern USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[21]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[22]  Ronald Fagin,et al.  An internal semantics for modal logic , 1985, STOC '85.

[23]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[24]  Peter van Emde Boas,et al.  The Conway Paradox: Its Solution in an Epistemic Framework , 1984 .

[25]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..