Multi-Agent Systems

MAS Lecturers Literature Schedule Outline Participants Projects Grading Results Links
Required Literature | Errata | 

Errata

Unfortunately, the book by Van der Hoek & Meyer contains a number of errors. Below are the corrections.
Errata


Errata


Reference

W. van der Hoek en J.-J. Ch. Meyer, Epistemic Logic for AI and Computer Science (Cambridge Tracts in Theoretical Computer Science, No 41), Cambridge University Press, 1995, ISBN: 0-52146014-X.

More errata are always welcome at l.c.verbrugge@ai.rug.nl.


Page number plus place

Current item

To be changed into this item

page 14

Def. 1.4.2 (iii)

if any finite subset of $\Phi$ is consistent

if all finite subsets of $\Phi$ are consistent

page 21

line 1

Then by Lemma 1.4.3(ii) there exists

Then by Lemma 1.4.3(i) there exists

page 30

line 3

the truth assignment

the same truth assignment

page 37

line 1 of proof of Theorem 1.7.6.4

$\varphi$

$\varphi$ and all formulas of length $\leq \mid\varphi \mid$

page 45

last line

$s=s_0 \rightarrow s_1 \rightarrow\ldots s_k=t$

$s=s_0 (\rightarrow s_1\rightarrow)\ldots s_k=t$

(in order to include the case $s\rightarrow^0 s$)

page 57

line 3

and do not cheat.

and do not cheat. Moreover, all this is common knowledge among the children

page 57

last line

$R_i(s,s')\Leftrightarrow x_i \not = x'_i\Leftrightarrow \mbox{ and } x_j=x'_j \mbox{ for all } j\not = i.$

$R_i(s,s')\Leftrightarrow s_j=s'_j \mbox{ for all } j\not = i.$

page 67

line 1 of proof of Theorem 2.3.2

The proof of this theorem

The proof of the completeness direction of this theorem

page 67

line 2 and 3 of proof of Theorem 2.3.2

Exercise 2.3.1.1

Exercise 2.3.1.2

page 83

line 3 of 2.10

these validities are not aware of

the agents are not aware of these validities

page 233

line 5 of 1.3.0.1 (i)

$(M,s)\models \neg \psi$

$(M,s)\models \psi$

page 236

line 4 of 1.3.1.1 (ii)

there exists $t$ with $R_A s_1 t$ and

there exists $t$ with ($R_A s_1 t$ and

page 236

line 5 of 1.3.1.1 (iii)

$(M,t)\models \neg p$

$(M,t)\models p$

page 236

line 6 of 1.3.1.1 (iii)

$R_a s_1 s_2$ and $(M,s_2) \models \neg p$

$R_a s_1 s_1$ and $(M,s_1) \models p$

page 236

line 2 of 1.3.1.1 (iv)

$R_A$

$R_B$

(twice)

page 236

line 7 of 1.3.1.1 (v)

$(M,s_1)\models p$ and $(M,s_2)\models \neg p$

$(M,s_1)\models p$ and $(M,s_3) \models p$ and $(M,s_2)\models \neg p$

page 238

line 2 of 1.3.2 (xii)

alle $u$

all $u$

page 239

line 3 of 1.3.3 (i)

conjucnt

conjunct

page 239

line 1 of 1.3.3 (ii)

t$\wedge \neg K_1 p \wedge \neg K_1 q)$

$\wedge (\neg K_1 p \wedge \neg K_1 q)$

page 240

1.3.5.3 (iv)

$M_i(\varphi \vee \psi) \Leftrightarrow \neg K_i (\neg\varphi \vee \neg psi)$

$M_i(\varphi \vee \psi) \Leftrightarrow \neg K_i (\neg\varphi \wedge \neg psi)$

page 263

line 4 of 2.3.1.2

$(s_{\Theta}, s_{\Psi})\in R^c_I$

$(s_{\Theta}, s_{\Psi})\in R^c_i$ for all $i\leq m$

page 335

line 4 from bottom

Proceedimgs

Proceedings

2010