Theory of Equivalence Relations (A, R) (E1) For all x : xRx. (E2) For all x, y : If xRy then yRx. (E3) For all x, y, z : If xRy and yRz then xRz. Logic in Computer Science – p.2/16
Player i is rational\;R=nieN Ri. Also, Bi(E) is the event \Player i is certain that E is true\ and B(E)=neN Bi(E). This is as in Lecture 7. Let me introduce the following notation for iterated mutual certainty: B()(E)=E B()(E)=B(B-I)(E)). Then the definition of Bk in Lecture 7 can be rewritten as Bk
Eco514 Game Theory Problem Set 2: Due Thursday, October 14 Recall the following definitions: in any model M=(, (Ti, a: )eN), Ri is the event \Player i is rational\; R ien. Also, (E) is the event \Player i is certain that E is true\ and(E) NieN B (). This is as in Lecture 7
In this problem we will study the effects of adding rules to the rule- base. Suppose that we use seven triangular membership functions on each universe of discourse and make them uniformly distributed in the same manner as how we did in Exercise 2.3. In particular make the points at which the outermost input membership functions for e saturate at +r/2 and for e at tr/4 For u make the outermost ones have their peaks