• Source: Epistemic modal logic

Epistemic modal logic is a subfield of modal logic that is concerned with reasoning about knowledge. While epistemology has a long philosophical tradition dating back to Ancient Greece, epistemic logic is a much more recent development with applications in many fields, including philosophy, theoretical computer science, artificial intelligence, economics, and linguistics. While philosophers since Aristotle have discussed modal logic, and Medieval philosophers such as Avicenna, Ockham, and Duns Scotus developed many of their observations, it was C. I. Lewis who created the first symbolic and systematic approach to the topic, in 1912. It continued to mature as a field, reaching its modern form in 1963 with the work of Kripke.




Historical development


Many papers were written in the 1950s that spoke of a logic of knowledge in passing, but the Finnish philosopher G. H. von Wright's 1951 paper titled An Essay in Modal Logic is seen as a founding document. It was not until 1962 that another Finn, Hintikka, would write Knowledge and Belief, the first book-length work to suggest using modalities to capture the semantics of knowledge rather than the alethic statements typically discussed in modal logic. This work laid much of the groundwork for the subject, but a great deal of research has taken place since that time. For example, epistemic logic has been combined recently with some ideas from dynamic logic to create dynamic epistemic logic, which can be used to specify and reason about information change and exchange of information in multi-agent systems. The seminal works in this field are by Plaza, Van Benthem, and Baltag, Moss, and Solecki.




Standard possible worlds model


Most attempts at modeling knowledge have been based on the possible worlds model. In order to do this, we must divide the set of possible worlds between those that are compatible with an agent's knowledge, and those that are not. This generally conforms with common usage. If I know that it is either Friday or Saturday, then I know for sure that it is not Thursday. There is no possible world compatible with my knowledge where it is Thursday, since in all these worlds it is either Friday or Saturday. While we will primarily be discussing the logic-based approach to accomplishing this task, it is worthwhile to mention here the other primary method in use, the event-based approach. In this particular usage, events are sets of possible worlds, and knowledge is an operator on events. Though the strategies are closely related, there are two important distinctions to be made between them:

The underlying mathematical model of the logic-based approach are Kripke semantics, while the event-based approach employs the related Aumann structures based on set theory.
In the event-based approach logical formulas are done away with completely, while the logic-based approach uses the system of modal logic.
Typically, the logic-based approach has been used in fields such as philosophy, logic and AI, while the event-based approach is more often used in fields such as game theory and mathematical economics. In the logic-based approach, a syntax and semantics have been built using the language of modal logic, which we will now describe.




= Syntax

=
The basic modal operator of epistemic logic, usually written K, can be read as "it is known that," "it is epistemically necessary that," or "it is inconsistent with what is known that not." If there is more than one agent whose knowledge is to be represented, subscripts can be attached to the operator (






K



1




{\displaystyle {\mathit {K}}_{1}}

,






K



2




{\displaystyle {\mathit {K}}_{2}}

, etc.) to indicate which agent one is talking about. So






K



a


φ


{\displaystyle {\mathit {K}}_{a}\varphi }

can be read as "Agent



a


{\displaystyle a}

knows that



φ


{\displaystyle \varphi }

." Thus, epistemic logic can be an example of multimodal logic applied for knowledge representation. The dual of K, which would be in the same relationship to K as



◊


{\displaystyle \Diamond }

is to



◻


{\displaystyle \Box }

, has no specific symbol, but can be represented by



¬

K

a


¬
φ


{\displaystyle \neg K_{a}\neg \varphi }

, which can be read as "



a


{\displaystyle a}

does not know that not



φ


{\displaystyle \varphi }

" or "It is consistent with



a


{\displaystyle a}

's knowledge that



φ


{\displaystyle \varphi }

is possible". The statement "



a


{\displaystyle a}

does not know whether or not



φ


{\displaystyle \varphi }

" can be expressed as



¬

K

a


φ
∧
¬

K

a


¬
φ


{\displaystyle \neg K_{a}\varphi \land \neg K_{a}\neg \varphi }

.
In order to accommodate notions of common knowledge (e.g. in the Muddy Children Puzzle) and distributed knowledge, three other modal operators can be added to the language. These are






E




G





{\displaystyle {\mathit {E}}_{\mathit {G}}}

, which reads "every agent in group G knows" (mutual knowledge);






C




G





{\displaystyle {\mathit {C}}_{\mathit {G}}}

, which reads "it is common knowledge to every agent in G"; and






D




G





{\displaystyle {\mathit {D}}_{\mathit {G}}}

, which reads "it is distributed knowledge to the whole group G." If



φ


{\displaystyle \varphi }

is a formula of our language, then so are






E



G


φ


{\displaystyle {\mathit {E}}_{G}\varphi }

,






C



G


φ


{\displaystyle {\mathit {C}}_{G}\varphi }

, and






D



G


φ


{\displaystyle {\mathit {D}}_{G}\varphi }

. Just as the subscript after





K




{\displaystyle {\mathit {K}}}

can be omitted when there is only one agent, the subscript after the modal operators





E




{\displaystyle {\mathit {E}}}

,





C




{\displaystyle {\mathit {C}}}

, and





D




{\displaystyle {\mathit {D}}}

can be omitted when the group is the set of all agents.




= Semantics

=
As mentioned above, the logic-based approach is built upon the possible worlds model, the semantics of which are often given definite form in Kripke structures, also known as Kripke models. A Kripke structure





M


=
⟨
S
,
π
,

K

1


,
…
,

K

n


⟩


{\displaystyle {\mathcal {M}}=\langle S,\pi ,K_{1},\dots ,K_{n}\rangle }

for n agents over



Φ


{\displaystyle \Phi }

, the set of all primitive propositions, is an



(
n
+
2
)


{\displaystyle (n+2)}

-tuple, where



S


{\displaystyle S}

is a nonempty set of states or possible worlds,



π


{\displaystyle \pi }

is an interpretation, which associates with each state



s
∈
S


{\displaystyle s\in S}

a truth assignment to the primitive propositions in



Φ


{\displaystyle \Phi }

, and






K



1


,
.
.
.
,



K



n




{\displaystyle {\mathcal {K}}_{1},...,{\mathcal {K}}_{n}}

are binary relations on



S


{\displaystyle S}

for n numbers of agents. It is important here not to confuse




K

i




{\displaystyle K_{i}}

, our modal operator, and






K



i




{\displaystyle {\mathcal {K}}_{i}}

, our accessibility relation.
The truth assignment tells us whether or not a proposition



p


{\displaystyle p}

is true or false in a certain state. So



π
(
s
)
(
p
)


{\displaystyle \pi (s)(p)}

tells us whether



p


{\displaystyle p}

is true in state



s


{\displaystyle s}

in model





M




{\displaystyle {\mathcal {M}}}

. Truth depends not only on the structure, but on the current world as well. Just because something is true in one world does not mean it is true in another. To state that a formula



φ


{\displaystyle \varphi }

is true at a certain world, one writes



(


M


,
s
)
⊨
φ


{\displaystyle ({\mathcal {M}},s)\models \varphi }

, normally read as "



φ


{\displaystyle \varphi }

is true at



(


M


,
s
)


{\displaystyle ({\mathcal {M}},s)}

," or "



(


M


,
s
)


{\displaystyle ({\mathcal {M}},s)}

satisfies



φ


{\displaystyle \varphi }

".
It is useful to think of our binary relation






K



i




{\displaystyle {\mathcal {K}}_{i}}

as a possibility relation, because it is meant to capture what worlds or states agent i considers to be possible; In other words,



w



K



i


v


{\displaystyle w{\mathcal {K}}_{i}v}

if and only if



∀
φ
[
(
w
⊨

K

i


φ
)

⟹

(
v
⊨
φ
)
]


{\displaystyle \forall \varphi [(w\models K_{i}\varphi )\implies (v\models \varphi )]}

, and such



v


{\displaystyle v}

's are called epistemic alternatives for agent i. In idealized accounts of knowledge (e.g., describing the epistemic status of perfect reasoners with infinite memory capacity), it makes sense for






K



i




{\displaystyle {\mathcal {K}}_{i}}

to be an equivalence relation, since this is the strongest form and is the most appropriate for the greatest number of applications. An equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The accessibility relation does not have to have these qualities; there are certainly other choices possible, such as those used when modeling belief rather than knowledge.




The properties of knowledge


Assuming that






K



i




{\displaystyle {\mathcal {K}}_{i}}

is an equivalence relation, and that the agents are perfect reasoners, a few properties of knowledge can be derived. The properties listed here are often known as the "S5 Properties," for reasons described in the Axiom Systems section below.




= The distribution axiom

=
This axiom is traditionally known as K. In epistemic terms, it states that if an agent knows



φ


{\displaystyle \varphi }

and knows that



φ

⟹

ψ


{\displaystyle \varphi \implies \psi }

, then the agent must also know




ψ


{\displaystyle \,\psi }

. So,




(

K

i


φ
∧

K

i


(
φ

⟹

ψ
)
)

⟹


K

i


ψ


{\displaystyle (K_{i}\varphi \land K_{i}(\varphi \implies \psi ))\implies K_{i}\psi }


This axiom is valid on any frame in relational semantics. This axiom logically establishes modus ponens as a rule of inference for every epistemically possible world.




= The knowledge generalization rule

=
Another property we can derive is that if



ϕ


{\displaystyle \phi }

is valid (i.e. a tautology), then




K

i


ϕ


{\displaystyle K_{i}\phi }

. This does not mean that if



ϕ


{\displaystyle \phi }

is true, then agent i knows



ϕ


{\displaystyle \phi }

. What it means is that if



ϕ


{\displaystyle \phi }

is true in every world that an agent considers to be a possible world, then the agent must know



ϕ


{\displaystyle \phi }

at every possible world. This principle is traditionally called N (Necessitation rule).





if

⊨
φ

then

M
⊨

K

i


φ
.



{\displaystyle {\text{if }}\models \varphi {\text{ then }}M\models K_{i}\varphi .\,}


This rule always preserves truth in relational semantics.




= The knowledge or truth axiom

=
This axiom is also known as T. It says that if an agent knows facts, the facts must be true. This has often been taken as the major distinguishing feature between knowledge and belief. We can believe a statement to be true when it is false, but it would be impossible to know a false statement.





K

i


φ

⟹

φ


{\displaystyle K_{i}\varphi \implies \varphi }


This axiom can also be expressed in its contraposition as agents cannot know a false statement:




φ

⟹

¬

K

i


¬
φ


{\displaystyle \varphi \implies \neg K_{i}\neg \varphi }


This axiom is valid on any reflexive frame.




= The positive introspection axiom

=
This property and the next state that an agent has introspection about its own knowledge, and are traditionally known as 4 and 5, respectively. The Positive Introspection Axiom, also known as the KK Axiom, says specifically that agents know that they know what they know. This axiom may seem less obvious than the ones listed previously, and Timothy Williamson has argued against its inclusion forcefully in his book, Knowledge and Its Limits.





K

i


φ

⟹


K

i



K

i


φ


{\displaystyle K_{i}\varphi \implies K_{i}K_{i}\varphi }


Equivalently, this modal axiom 4 says that agents do not know what they do not know that they know




¬

K

i



K

i


φ

⟹

¬

K

i


φ


{\displaystyle \neg K_{i}K_{i}\varphi \implies \neg K_{i}\varphi }


This axiom is valid on any transitive frame.




= The negative introspection axiom

=
The Negative Introspection Axiom says that agents know that they do not know what they do not know.




¬

K

i


φ

⟹


K

i


¬

K

i


φ


{\displaystyle \neg K_{i}\varphi \implies K_{i}\neg K_{i}\varphi }


Or, equivalently, this modal axiom 5 says that agents know what they do not know that they do not know




¬

K

i


¬

K

i


φ

⟹


K

i


φ


{\displaystyle \neg K_{i}\neg K_{i}\varphi \implies K_{i}\varphi }


This axiom is valid on any Euclidean frame.




= Axiom systems

=
Different modal logics can be derived from taking different subsets of these axioms, and these logics are normally named after the important axioms being employed. However, this is not always the case. KT45, the modal logic that results from the combining of K, T, 4, 5, and the Knowledge Generalization Rule, is primarily known as S5. This is why the properties of knowledge described above are often called the S5 Properties. However, it can be proven that modal axiom B is a theorem in S5 (viz.



S
5
⊢

B



{\displaystyle S5\vdash \mathbf {B} }

), which says that what an agent does not know that they do not know is true:



¬

K

i


¬

K

i


φ

⟹

φ


{\displaystyle \neg K_{i}\neg K_{i}\varphi \implies \varphi }

. The modal axiom B is true on any symmetric frame, but is very counterintuitive in epistemic logic: How can the ignorance on one's own ignorance imply truth? It is therefore debatable whether S4 describes epistemic logic better, rather than S5.
Epistemic logic also deals with belief, not just knowledge. The basic modal operator is usually written B instead of K. In this case, though, the knowledge axiom no longer seems right—agents only sometimes believe the truth—so it is usually replaced with the Consistency Axiom, traditionally called D:




¬

B

i


⊥


{\displaystyle \neg B_{i}\bot }


which states that the agent does not believe a contradiction, or that which is false. When D replaces T in S5, the resulting system is known as KD45. This results in different properties for






K



i




{\displaystyle {\mathcal {K}}_{i}}

as well. For example, in a system where an agent "believes" something to be true, but it is not actually true, the accessibility relation would be non-reflexive. The logic of belief is called doxastic logic.




= Multi-agent systems

=
When there are multiple agents in the domain of discourse where each agent i corresponds to a separate epistemic modal operator




K

i




{\displaystyle K_{i}}

, in addition to the axiom schemata for each individual agent listed above to describe the rationality of each agent, it is usually also assumed that the rationality of each agent is common knowledge.




Problems with the possible world model and modal model of knowledge


If we take the possible worlds approach to knowledge, it follows that our epistemic agent a knows all the logical consequences of their beliefs (known as logical omniscience). If



Q


{\displaystyle Q}

is a logical consequence of



P


{\displaystyle P}

, then there is no possible world where



P


{\displaystyle P}

is true but



Q


{\displaystyle Q}

is not. So if a knows that



P


{\displaystyle P}

is true, it follows that all of the logical consequences of



P


{\displaystyle P}

are true of all of the possible worlds compatible with a's beliefs. Therefore, a knows



Q


{\displaystyle Q}

. It is not epistemically possible for a that not-



Q


{\displaystyle Q}

given his knowledge that



P


{\displaystyle P}

. This consideration was a part of what led Robert Stalnaker to develop two-dimensionalism, which can arguably explain how we might not know all the logical consequences of our beliefs even if there are no worlds where the propositions we know come out true but their consequences false.
Even when we ignore possible world semantics and stick to axiomatic systems, this peculiar feature holds. With K and N (the Distribution Rule and the Knowledge Generalization Rule, respectively), which are axioms that are minimally true of all normal modal logics, we can prove that we know all the logical consequences of our beliefs. If



Q


{\displaystyle Q}

is a logical consequence of



P


{\displaystyle P}

(i.e. we have the tautology



⊨
(
P
→
Q
)


{\displaystyle \models (P\rightarrow Q)}

), then we can derive




K

a


(
P
→
Q
)


{\displaystyle K_{a}(P\rightarrow Q)}

with N, and using a conditional proof with the axiom K, we can then derive




K

a


P
→

K

a


Q


{\displaystyle K_{a}P\rightarrow K_{a}Q}

with K. When we translate this into epistemic terms, this says that if



Q


{\displaystyle Q}

is a logical consequence of



P


{\displaystyle P}

, then a knows that it is, and if a knows



P


{\displaystyle P}

, a knows



Q


{\displaystyle Q}

. That is to say, a knows all the logical consequences of every proposition. This is necessarily true of all classical modal logics. But then, for example, if a knows that prime numbers are divisible only by themselves and the number one, then a knows that 8683317618811886495518194401279999999 is prime (since this number is only divisible by itself and the number one). That is to say, under the modal interpretation of knowledge, when a knows the definition of a prime number, a knows that this number is prime. This generalizes to any provable theorem in any axiomatic theory (i.e. if a knows all the axioms in a theory, then a knows all the provable theorems in that theory). It should be clear at this point that a is not human (otherwise there would not be any unsolved conjectures in mathematics, like P versus NP problem or Goldbach's conjecture). This shows that epistemic modal logic is an idealized account of knowledge, and explains objective, rather than subjective knowledge (if anything).




Epistemic fallacy (masked-man fallacy)


In philosophical logic, the masked-man fallacy (also known as the intensional fallacy or epistemic fallacy) is committed when one makes an illicit use of Leibniz's law in an argument. The fallacy is "epistemic" because it posits an immediate identity between a subject's knowledge of an object with the object itself, failing to recognize that Leibniz's Law is not capable of accounting for intensional contexts.




= Examples

=
The name of the fallacy comes from the example:

Premise 1: I know who Bob is.
Premise 2: I do not know who the masked man is
Conclusion: Therefore, Bob is not the masked man.
The premises may be true and the conclusion false if Bob is the masked man and the speaker does not know that. Thus the argument is a fallacious one.
In symbolic form, the above arguments are

Premise 1: I know who X is.
Premise 2: I do not know who Y is.
Conclusion: Therefore, X is not Y.
Note, however, that this syllogism happens in the reasoning by the speaker "I"; Therefore, in the formal modal logic form, it'll be

Premise 1: The speaker believes he knows who X is.
Premise 2: The speaker believes he does not know who Y is.
Conclusion: Therefore, the speaker believes X is not Y.
Premise 1






B



s


∀
t
(
t
=
X
→

K

s


(
t
=
X
)
)


{\displaystyle {\mathcal {B}}_{s}\forall t(t=X\rightarrow K_{s}(t=X))}

is a very strong one, as it is logically equivalent to






B

s




∀
t
(
¬

K

s


(
t
=
X
)
→
t
≠
X
)


{\displaystyle {\mathcal {B_{s}}}\forall t(\neg K_{s}(t=X)\rightarrow t\not =X)}

. It is very likely that this is a false belief:



∀
t
(
¬

K

s


(
t
=
X
)
→
t
≠
X
)


{\displaystyle \forall t(\neg K_{s}(t=X)\rightarrow t\not =X)}

is likely a false proposition, as the ignorance on the proposition



t
=
X


{\displaystyle t=X}

does not imply the negation of it is true.
Another example:

Premise 1: Lois Lane thinks Superman can fly.
Premise 2: Lois Lane thinks Clark Kent cannot fly.
Conclusion: Therefore, Superman and Clark Kent are not the same person.
Expressed in doxastic logic, the above syllogism is:

Premise 1:






B



Lois




Fly


(Superman)




{\displaystyle {\mathcal {B}}_{\text{Lois}}{\text{Fly}}_{\text{(Superman)}}}


Premise 2:






B



Lois


¬


Fly


(Clark)




{\displaystyle {\mathcal {B}}_{\text{Lois}}\neg {\text{Fly}}_{\text{(Clark)}}}


Conclusion:




Superman

≠

Clark



{\displaystyle {\text{Superman}}\neq {\text{Clark}}}


The above reasoning is invalid (not truth-preserving). The valid conclusion to be drawn is






B



Lois


(

Superman

≠

Clark

)


{\displaystyle {\mathcal {B}}_{\text{Lois}}({\text{Superman}}\neq {\text{Clark}})}

.




See also



Epistemic closure
Epistemology
Dynamic epistemic logic
Logic in computer science
Philosophical Explanations




Notes






References


Anderson, A. and N. D. Belnap. Entailment: The Logic of Relevance and Necessity. Princeton: Princeton University Press, 1975. ASIN B001NNPJL8.
Brown, Benjamin, Thoughts and Ways of Thinking: Source Theory and Its Applications. London: Ubiquity Press, 2017. [1].
van Ditmarsch Hans, Halpern Joseph Y., van der Hoek Wiebe and Kooi Barteld (eds.), Handbook of Epistemic Logic, London: College Publications, 2015.
Fagin, Ronald; Halpern, Joseph; Moses, Yoram; Vardi, Moshe (2003). Reasoning about Knowledge. Cambridge: MIT Press. ISBN 978-0-262-56200-3.. A classic reference.
Ronald Fagin, Joseph Halpern, Moshe Vardi. "A nonstandard approach to the logical omniscience problem." Artificial Intelligence, Volume 79, Number 2, 1995, p. 203-40.
Hendricks, V.F. Mainstream and Formal Epistemology. New York: Cambridge University Press, 2007.
Hintikka, Jaakko (1962). Knowledge and Belief - An Introduction to the Logic of the Two Notions. Ithaca: Cornell University Press. ISBN 978-1-904987-08-6..
Meyer, J-J C., 2001, "Epistemic Logic," in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
Montague, R. "Universal Grammar". Theoretica, Volume 36, 1970, p. 373-398.
Rescher, Nicolas (2005). Epistemic Logic: A Survey Of the Logic Of Knowledge. University of Pittsburgh Press. ISBN 978-0-8229-4246-7..
Shoham, Yoav; Leyton-Brown, Kevin (2009). Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. New York: Cambridge University Press. ISBN 978-0-521-89943-7.. See Chapters 13 and 14; downloadable free online.




External links


"Dynamic Epistemic Logic". Internet Encyclopedia of Philosophy.
Hendricks, Vincent; Symons, John. "Epistemic Logic". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.
Garson, James. "Modal logic". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.
Vanderschraaf, Peter. "Common Knowledge". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.
Epistemic modal logic at PhilPapers

"Epistemic modal logic"—Ho Ngoc Duc.

Kata Kunci Pencarian:

• Paradoks hukuman gantung tidak terduga
• Epistemic modal logic
• Modal logic
• Epistemic modality
• Normal modal logic
• S5 (modal logic)
• Common knowledge (logic)
• Logic
• Epistemic possibility
• Modality (semantics)
• Doxastic logic