5-2.3 Generalizing the adjustment algorithm within a record.
By using induction we may
determine an adjusted presence value (apk) for the four valid combinations of three presence
dependent fields as the following:
| [ 1, 2, 3 ] | ap3 = p3 |
| [ 1, 2 ] | ap2 = p2 – p3 |
| [ 1 ] | ap1 = p1 – p2 |
| [ ] | ap0 = 1 – p1 |
The generalization of this algorithm allows us to calculate the adjusted presence values for
combinations of fields in dependency chains of arbitrary length (n). We say that k = i, except where
k = i = 0 where po = 1, and where k = i = n+1 where pn+1 = 0.
