3.11ABBA030409

3.11ABBA030409 - 1 3.11. ABBA. Recall the reduced AB table...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 3.11. ABBA. Recall the reduced AB table from section 3.5. REDUCED AB 1. A . fA B . gA. INF. AL. ALF. FIN. NON. 2. A . fA B . gB. INF. AL. ALF. FIN. NON. 3. A . fA B . gC. INF. AL. ALF. FIN. NON. 4. C . fA B . gA. INF. AL. ALF. FIN. NON. 5. C . fA B . gB. INF. AL. ALF. FIN. NON. 6. C . fA B . gC. INF. AL. ALF. FIN. NON. Recall the reduced BA table from section 3.6. REDUCED BA 1’. B . fB A . gB. INF. AL. ALF. FIN. NON. 2’. B . fB A . gA. INF. AL. ALF. FIN. NON. 3’. B . fB A . gC. INF. AL. ALF. FIN. NON. 4’. C . fB A . gB. INF. AL. ALF. FIN. NON. 5’. C . fB A . gA. INF. AL. ALF. FIN. NON. 6’. C . fB A . gC. INF. AL. ALF. FIN. NON. This results in 36 ordered pairs. We can take advantage of symmetry through interchanging A with B as follows. Clearly (i,j’) and (j,i’) are equivalent, since interchanging A and B takes us from p to p’ and back. So we can require that i j. Thus we have the following 21 ordered pairs to consider. We need to determine the status of all attributes INF, Al, ALF, FIN, NON, for each pair. 1,1’. A
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/05/2011 for the course MATH 366 taught by Professor Joshua during the Fall '08 term at Ohio State.

Page1 / 3

3.11ABBA030409 - 1 3.11. ABBA. Recall the reduced AB table...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online