In this chapter we will show that every vf-pair within the conditional contribution of a ca-conditional can be calculated as the sum of those vf-pairs which are counted by the canonical a-segments. This result will serve us as a base for the upcoming chapters.
The results of this chapter only apply to ca-conditionals. In chapters 6 and 8 we will show how these results can also be applied to c- and ca-conditionals.
5.1 vf–Pairs of A-Segments in a CA-Conditional Without Non-Local Instantiation Restrictions
In this section we will show that for a ca-conditional which is free of non-local instantiation restrictions the vf-pairs contributed by the composed a-segments can be calculated by summing up the vf-pairs contributed by the canonical a-segments.
This result will be further generalized in the next section to ca-conditionals with all type of instantiation restrictions. We decided to start from this more restrictive case here to allow for a step-by-step introduction of the key concepts. The current section therefore can be regarded as a first introduction to the methods which allow us to create sums of vf-pairs. Also only in this section we will rely on the assumptions expressed in section 4.9 concerning the influence of instantiation restrictions on the counting functions.
The next definition introduces canonical and composed vf-pairs, which are those vf-pairs which are contributed by the respective a-segments, as defined by in definition 28.
Definition 36 (Canonical and Composed vf-Pairs)
Let be a ca-conditional. Let be a c-segment of .
A vf-pair is called a canonical vf-pair iff it is contributed by a canonical a-segment of .
A vf-pair is called a composed vf-pair iff it contributed by a composed a-segment of .
We will now show that the composed vf-pairs of a ca-conditional (which is free of non-local instantiation restrictions) can be calculated as the sums of canonical vf-pairs.
Proposition 9 (vf-Pairs of A-Segments in a CA-Conditional With Only Local Instantiation Restrictions)
Let be a ca-conditional whereby includes no non-local instantiation restrictions.
Then it holds for all and for all that
Proof
Let be the number of c-atoms and let be the number of a-atoms of .
We first show that the semantical combinations creates combinations of all c-segments with all a-segments.
As is a ca-conditional it holds that and therefore it is and if follows that . It therefore holds that the set of c-atoms and the set of a-atoms are independent of each other. The semantical combination function will therefore create for every c-segment a combination with every a-segment , regardless of how the truth values are set. This means specifically that .
We now show that for a given c-segment every canonical a-segment contributes the same vf-pair.
Let be any a-atom of and be the index of . Then it holds based on definition 27 that . It follows that the atomic counting function counts all groundings of the form for which .
As there are no non-local instantiation restrictions the instantiation of groundings of is the combination of all c-atoms with all a-atoms of . It follows that for and for every c-atom there exists a grounding of the form . It follows for the case of the canonical a-segment that counts exactly the number of c-atoms which are verified by , so that .
In the same way it can be shown that , so that .
We now show that for a given c-segment every composed a-segment contributes the same vf-pair.
If more than one a-atom is set within an a-segment , it holds for every with that . For each such verified a-atom the counting function counts all c-atoms for which . This is the same result as shown for the canonical a-segment in the last paragraph, i.e. the verified a-atom contributes to the composed vf-pair the canonical vf-pair .
As this holds for all verified a-atoms in it is .□
Proposition 9 shows why we chose the terms "canonical" and "composed" in definition 28 and definition 36. The vf-pairs generated by the a-segments of ca-conditionals are very similar to the canonical vectors in a vector space, as each composed vf-pair can be expressed as a sum of the canonical vf-pairs contributed by canonical a-segments. With this we can regard any vf-pair as a sum of vf-pairs (a canonical vf-pair is are just the sum of itself with nothing else). Therefore it is sufficient to perform the counting functions only for the canonical a-segments, all the other vf-pairs can then just be summed up.
The next definition is just for wording purposes and was in fact already used in an informal way in the last proof. We will use it not only for ca-conditionals but for cac-conditionals in general.
Definition 37 (Contribution of a Canonical A-Segment)
Let be a cac-conditional. Let be an a-atom of and let be the index of , so that is a canonical a-segment of . Let be an a-segment and a c-segment of .
We say that contributes to . We also say that contributes to .
It is the contribution of (or respectively).
The following proposition states that in case of a ca-conditional with only local instantiation restrictions, every canonical a-segment contributes the same vf-pair to the composed vf-pairs within a conditional impact.
Proposition 10 (Contributions of A-Segments of a CA-Conditional Without Non-Local Instantiation Restrictions)
Let be a ca-conditional with only local instantiation restrictions. Let be a c-segment of .
Then it holds that for the conditional impact all canonical vf-pairs are identical.
Proof
This was already shown in the proof of proposition 9.□
Example 30 (vf-Pairs of A-Segments in a CA-Conditional without Instantiation Restrictions)
Let be a sort, be variables ranging over and be a ca-conditional.
Table 5.1 shows the vf truth table of . The lines in the table which indicate represent those possible worlds which verify both and and due to proposition 9 the related vf-pairs can be calculated from the vf-pairs of the respective two lines above, in which either only or only is verified (all for the same c-segment).
We then can say that e.g. in the fourth line () of table 5.1 the canonical a-segments and both contribute the canonical vf-pair to the composed vf-pair .
We now introduce a new style of vf truth tables, the reduced vf truth table which allows for better overview and readability. Note that we will further modify the reduced vf truth table in the upcoming chapters but the basic structure of the table will stay the same.
Example 31 (Reduced vf Truth Tables)
Continuing from example 30.
Table 5.2 shows a more compact version of the truth table in table 5.1.
On its left side the table lists all c-segments as rows and on the top all a-segments as columns. This is similar to the tables we have seen in example 26 for the unification function. For better readability the rows/columns of the canonical segments indicate the related ground atoms which are set in the possible world segment. The combination of truth values can be read from the indexes of the different possible world segments (e.g. indicates the c-segment where and ). We also show the c-atoms as separate columns and below them the truth values assigned to them by the c-segments.
The cells below the a-segments indicate the vf-pairs resulting from the semantical combination of the two possible world segments in the row (c-segment) and the column (a-segment). All vf-pairs to the right of the canonical a-segments can be calculated by simply adding the canonical vf-pairs.
Finally the last row shows the mos notation of the vf-pairs in the related column, which makes the generated conditional contribution easy to read, as .
5.2 vf-Pairs of A-Segments in a CA-Conditional With All Types Of Instantiation Restrictions
The results of section 5.2 only work for ca-conditionals which are free of non-local instantiation restrictions. Due to this restriction the contributions of the different canonical a-segments are identical within a c-segment. In this section we de-couple the canonical a-segments in a way which allows us to generate and accumulate their contributions individually. With this it is then possible to generate the vf-pairs of all ca-conditionals, i.e. their conditional contribution, regardless of the type of instantiation restriction used.
Definition 38 (Set of C-Atoms Counted by an A-Atom)
Let be a cac-conditional. Let be an a-atom of .
The set of c-atoms counted by is
Example 32 (Set of C-Atoms Counted by an A-Atom)
Let be a sort, be variables ranging over and be a ca-conditional.
Then we get
Definition 38 assigns to every canonical a-segment the set of those c-atoms which the a-segment contributes to the relevant counting functions and , which then form the vf-pair. With these sets we have de-coupled the canonical a-segments from each other, so that they can contribute different values to the counting functions.
The following proposition is nearly identical to proposition 9 but allows any type of instantiation restrictions. Nevertheless, it is only valid for a ca-conditional, i.e. it requires that .
Proposition 11 (vf-Pairs of A-Segments in a CA-Conditional)
Let be a ca-conditional.
It holds for all and for all that
Proof
Let be an a-atom of and be the index of so that is the canonical a-segment of related to . Let be a c-segment of .
Let and be the results of the counting functions for and
Based on the definition of a-segments it holds for every composed a-segment and for every with that .
Let be a composed a-segment of with .
It then holds that counts those groundings of in which is either verified or falsified, i.e. contributes the canonical vf-pair to the composed vf-pair . As this holds for all verified a-atoms in it follows
□Example 33 (vf-Pairs of A-Segments in a CA-Conditional)
Let be a sort, be variables ranging over and be a ca-conditional.
It is
For better overview, 5.3 shows an (incomplete) old-fashioned vf truth table, of which a number of lines have been left out, to make the table more readable.
Table 5.4 shows the reduced vf truth table.
It is .
The following proposition shows that for a ca-conditional the contributions of a single a-segment over all c-segments is always a MOS. This finding is essential for the next chapter where we will look into the calculation of conditional contributions.
Proposition 12 (Canonical A-Segments of CA-Conditionals Generate Maximum Ordered Sum)
Let be an ca-conditional with and .
For any canonical a-segment it holds that the set of vf-pairs is the MOS .
Proof
We first show the sum of the atomic counting functions for any given c-atom and any given canonical a-atom is .
Let be the a-atom of with index .
It is the set of all c-segments of , whereby every c-segment assigns a different combination of truth values to the ground atoms within .
As is a canonical a-segment it holds for all with that .
It then holds that
which is equivalent to
In the same way it holds that
As either verifies or falsifies every c-atom it follows that the sum of the atomic counting functions is the number of c-atoms which occur together with a-atom in any grounding of , which is . It follows that for all it holds that
and therefore it holds that .
We now show that the set of all vf-pairs contributed by is .
Let and let
and
As every c-segment assigns a different combination of truth values to the c-atoms and as is the set of all c-segments, i.e. all possible combinations of such truth values, it follows that and in the same way that . It follows that
It is important to note that the above proposition only holds for ca-conditionals and, as we will show in section 6.1, for c-conditionals. It does not hold for cc-conditionals, as we will show in section 6.3.
Proposition 12 also makes it to check the completeness of reduced vf truth tables, as the columns related to a canonical a-segment within a reduced vf truth table always include a complete set of MOSs.
Example 34 (Canonical A-Segments of CA-Conditionals Generate Maximum Ordered Sum)
From proposition 12 we can easily follow that composed a-segments of ca-conditionals contribute either a MOS or a multiple of a MOS.