Search

25 Nov 2002: But the map (a,b)-->(b,a) is easily seen to be a bijection between AxB and BxA, from which it follows that BxA has cardinality mn. ... If m=1 then the result is obvious, since the map (1,x)-->x is a bijection between AxB and B, B has cardinality n, and

24 Sep 2002: 1y wŽ. msyj s 1q j 2 j 3 j 4 jw q5w q5w q wq b b jÝ1 2 5j1y wŽ. ... P a, d s b 2 r q b b r q b 2 r , 5.8Ž.

20 May 2002: 15. p. 243, lines 6 and 9: replace "(., f((r - 1)b/N /- |B_r| (b/N)2))" by "(., f((r - 1)b/N) /- |B_r| (b/N)2)". ... the brackets are misplaced). 16. p. 247, line 6: delete "<= B b3 N(-2)" (I am not quite sure here.).

23 Sep 2002: Tu. 10 (One class, week 2). PROF. B. J. HEALEgoism, pleasure and value. ... 11 (Sixteen lectures). DR R. B. B. WARDY (CL)†Plato Republic 473–535.

1 Oct 2002: iff for every bundle b of S there exists a bundle b′ of S′ such that b = b′. ... b′ B | e b′ b′ b}. Proposition 6. For every b B and every e Eb the set deeb is a bundle in B.For every finite and compatible X B

31 Jan 2002: Searching for the optimum Root-Goal path. The methods of the previous section found some path between root and goal. A rather harder problem is to find the best path. For this we need to exploit the cost figures in the graph. British Museum. This

27 Aug 2002: xO:N"I(B B[CCFN[CjA@R[kND@5OQH5B"s ilkJFRO:BR[kCI(OQB[RDN[OQ5>5RDO:@H@]ºRDk5CR[@RFV ... Hc?5N[@5e"CBDBS@]NFRDCP¤ÌFHJIB[>?5?J@B[CSOQRR"FCB-R[OQXC=RD@Py-FVQFe"N[@B[B-R[kCuVFH5Ch¤ÇB[BD>5XOQH5¿R[kJFR-R[k5C?JCfI

26 Sep 2002: hom(A,f,B,g) {H A B. (f AA A) (g B B B) (xA. ... 1. [| J : A -> B; K : B -> C; f : A A -> A; g : B B -> B;.

11 Mar 2002: g : 〈aa〉 〈bb〉 Iisuch that g extends f (i.e. g f).Similarly, for every b B. ... For finite A and B,. (A, a) kω (B, b)if, and only if,.

13 Sep 2002: Negation Normal Form. 1. Get rid of and , leaving just , , :. A B ' (A B) (B A). A B ' A B. ... r). A B, B A(r). (A B) (B A)(r). III Logic and Proof 15.