×

A quantitative analysis of modal logic. (English) Zbl 0806.03017

The author is interested in modal logics which can be interpreted as epistemic logics with “multiple agents, so that we consider not only an agent’s belief about ‘nature’, but also his beliefs about beliefs of other agents” (209). For this purpose, standard semantics for modal logic along Kripkean lines would have to be generalized so that the accessibility-relation \(R\) is replaced by a family of relations \(R_ i\), where \(wR_ i w^*\) may be read as ‘in \(w\), agent \(a_ i\) considers \(w^*\) as possible’. However, the use of a Kripke-style semantics for epistemic logic is held to be problematic because “the notion of a possible world is a primitive notion”, and in epistemic logic “it is not clear what a possible world is” (210). Therefore the author has elsewhere developed an alternative semantics along the following lines: “At the bottom, or \(O\) th level, is a truth-assignment, which can be thought of as a state of nature. The next level describes each agent’s beliefs about nature, which corresponds to a set of truth assignments. Intuitively, these are the states of nature that the agent considers possible. The \((k+1)\)st-order belief of each agent is modeled by a set of possibilities, each of which is a description of a state of nature and each agent’s \(k\) th-order belief. […] A modal structure consists of a state of nature and each agent’s hierarchy of beliefs.” (210)
Given this framework, one can imagine situations where the agent’s beliefs no longer have a countable description, i.e. where it becomes necessary to extend the hierarchy of the modal structure “to levels \(\omega\), \(\omega+1\), and beyond”. The detailed paper offers a “quantitative” analysis of modal structures (and corresponding Kripke structures \(M\)) by studying, among others, “the least ordinal \(\mu\) such that for each state \(M\), the beliefs up to level \(\mu\) characterize the agents’ beliefs (that is, there is only one way to extend these beliefs to higher levels)”.

MSC:

03B45 Modal logic (including the logic of norms)
03C15 Model theory of denumerable and separable structures
Full Text: DOI

References:

[1] DOI: 10.1007/BF01770224 · Zbl 0567.90103 · doi:10.1007/BF01770224
[2] Model-theoretic logics pp 271– (1985)
[3] A mathematician’s miscellany (1953) · Zbl 0051.00101
[4] DOI: 10.1305/ndjfl/1093890715 · Zbl 0205.30306 · doi:10.1305/ndjfl/1093890715
[5] Journal of the Association for Computing Machinery 91 pp 384– (1991)
[6] Reasoning about Knowledge · Zbl 0839.68095
[7] Theoretical aspects of reasoning about knowledge: Proceedings of the fourth conference pp 229– (1992)
[8] Studia Logica 44 pp 197– (1983)
[9] A mathematical introduction to logic (1972)
[10] Proceedings of the 3rd Amsterdam Montague symposium pp 87– (1980)
[11] Model-theoretic logics pp 317– (1985)
[12] DOI: 10.1007/BF00370320 · Zbl 0467.03006 · doi:10.1007/BF00370320
[13] DOI: 10.1002/malq.19630090502 · Zbl 0118.01305 · doi:10.1002/malq.19630090502
[14] Universal partition structures (1993)
[15] Theory of Machines-and Computations pp 196– (1971)
[16] Journal of Applied Non Classical Logics 2 pp 81– (1992)
[17] Artificial Intelligence 53 pp 319– (1992) · Zbl 0864.00037
[18] DOI: 10.1145/79147.79161 · Zbl 0699.68115 · doi:10.1145/79147.79161
[19] A companion to modal logic (1984) · Zbl 0625.03005
[20] Annual review of computer science 2 pp 37– (1987)
[21] Proceedings of the 17th Association for Computing Machinery Symposium on Theory of Computing pp 305– (1985)
[22] DOI: 10.1305/ndjfl/1093891703 · Zbl 0245.02025 · doi:10.1305/ndjfl/1093891703
[23] An essay in classical modal logic (1971) · Zbl 0311.02028
[24] Theory of recursive functions and effective computability (1967) · Zbl 0183.01401
[25] Proceedings of the 17th IEEE symposium on foundations of computer science pp 109– (1976)
[26] Logic from computer science pp 481– (1992)
[27] Proceedings of the 5th GI Conference on theoretical computer science 104 (1981)
[28] Elementary induction on abstract structures (1974)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.