12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Monday November 25, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Functional Logic : Quantification Theory (view source)
Revision as of 01:30, 21 November 2008
, 01:30, 21 November 2008table widths @ 96%
Table 1 lists the sixteen higher order propositions about propositions on one boolean variable, organized in the following fashion: Columns 1 and 2 form a truth table for the four <math>f : \mathbb{B} \to \mathbb{B},</math> turned on its side from the way that one is most likely accustomed to see truth tables, with the row leaders in Column 1 displaying the names of the functions <math>f_i,\!</math> for <math>i\!</math> = 1 to 4, while the entries in Column 2 give the values of each function for the argument values that are listed in the corresponding column head. Column 3 displays one of the more usual expressions for the proposition in question. The last sixteen columns are topped by a collection of conventional names for the higher order propositions, also known as the ''measures'' <math>m_j,\!</math> for <math>j\!</math> = 0 to 15, where the entries in the body of the Table record the values that each <math>m_j\!</math> assigns to each <math>f_i.\!</math>
Table 1 lists the sixteen higher order propositions about propositions on one boolean variable, organized in the following fashion: Columns 1 and 2 form a truth table for the four <math>f : \mathbb{B} \to \mathbb{B},</math> turned on its side from the way that one is most likely accustomed to see truth tables, with the row leaders in Column 1 displaying the names of the functions <math>f_i,\!</math> for <math>i\!</math> = 1 to 4, while the entries in Column 2 give the values of each function for the argument values that are listed in the corresponding column head. Column 3 displays one of the more usual expressions for the proposition in question. The last sixteen columns are topped by a collection of conventional names for the higher order propositions, also known as the ''measures'' <math>m_j,\!</math> for <math>j\!</math> = 0 to 15, where the entries in the body of the Table record the values that each <math>m_j\!</math> assigns to each <math>f_i.\!</math>
{| align="center" border="1" cellpadding="4" cellspacing="0" style="font-weight:bold; text-align:center; width:90%"
{| align="center" border="1" cellpadding="4" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 1. Higher Order Propositions (''n'' = 1)'''
|+ '''Table 1. Higher Order Propositions (''n'' = 1)'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
I am going to put off explaining Table 2, that presents a sample of what I call ''interpretive categories'' for higher order propositions, until after we get beyond the 1-dimensional case, since these lower dimensional cases tend to be a bit ''condensed'' or ''degenerate'' in their structures, and a lot of what is going on here will almost automatically become clearer as soon as we get even two logical variables into the mix.
I am going to put off explaining Table 2, that presents a sample of what I call ''interpretive categories'' for higher order propositions, until after we get beyond the 1-dimensional case, since these lower dimensional cases tend to be a bit ''condensed'' or ''degenerate'' in their structures, and a lot of what is going on here will almost automatically become clearer as soon as we get even two logical variables into the mix.
{| align="center" border="1" cellpadding="4" cellspacing="0" style="font-weight:bold; text-align:center; width:90%"
{| align="center" border="1" cellpadding="4" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 2. Interpretive Categories for Higher Order Propositions (''n'' = 1)'''
|+ '''Table 2. Interpretive Categories for Higher Order Propositions (''n'' = 1)'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
There are <math>2^{16} = 65536\!</math> measures of the type <math>m : (\mathbb{B}^2 \to \mathbb{B}) \to \mathbb{B}.</math> Table 3 introduces the first 24 of these measures in the fashion of the higher order truth table that I used before. The column headed <math>m_j\!</math> shows the values of the measure <math>m_j\!</math> on each of the propositions <math>f_i : \mathbb{B}^2 \to \mathbb{B},</math> for <math>i\!</math> = 0 to 23, with blank entries in the Table being optional for values of zero. The arrangement of measures that continues according to the plan indicated here is referred to as the ''standard ordering'' of these measures. In this scheme of things, the index <math>j\!</math> of the measure <math>m_j\!</math> is the decimal equivalent of the bit string that is associated with <math>m_j\!</math>'s functional values, which can be obtained in turn by reading the <math>j^\mathrm{th}\!</math> column of binary digits in the Table as the corresponding range of boolean values, taking them up in the order from bottom to top.
There are <math>2^{16} = 65536\!</math> measures of the type <math>m : (\mathbb{B}^2 \to \mathbb{B}) \to \mathbb{B}.</math> Table 3 introduces the first 24 of these measures in the fashion of the higher order truth table that I used before. The column headed <math>m_j\!</math> shows the values of the measure <math>m_j\!</math> on each of the propositions <math>f_i : \mathbb{B}^2 \to \mathbb{B},</math> for <math>i\!</math> = 0 to 23, with blank entries in the Table being optional for values of zero. The arrangement of measures that continues according to the plan indicated here is referred to as the ''standard ordering'' of these measures. In this scheme of things, the index <math>j\!</math> of the measure <math>m_j\!</math> is the decimal equivalent of the bit string that is associated with <math>m_j\!</math>'s functional values, which can be obtained in turn by reading the <math>j^\mathrm{th}\!</math> column of binary digits in the Table as the corresponding range of boolean values, taking them up in the order from bottom to top.
{| align="center" border="1" cellpadding="0" cellspacing="0" style="font-weight:bold; text-align:center; width:100%"
{| align="center" border="1" cellpadding="0" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 3. Higher Order Propositions (''n'' = 2)'''
|+ '''Table 3. Higher Order Propositions (''n'' = 2)'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
incidentally providing compact names for the column headings of the next two Tables.
incidentally providing compact names for the column headings of the next two Tables.
{| align="center" border="1" cellpadding="1" cellspacing="0" style="font-weight:bold; text-align:center; width:90%"
{| align="center" border="1" cellpadding="1" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 4. Qualifiers of Implication Ordering: <math>\alpha_i f = \Upsilon (f_i \Rightarrow f)</math>'''
|+ '''Table 4. Qualifiers of Implication Ordering: <math>\alpha_i f = \Upsilon (f_i \Rightarrow f)</math>'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
|}<br>
|}<br>
{| align="center" border="1" cellpadding="1" cellspacing="0" style="font-weight:bold; text-align:center; width:90%"
{| align="center" border="1" cellpadding="1" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 5. Qualifiers of Implication Ordering: <math>\beta_i f = \Upsilon (f \Rightarrow f_i)</math>'''
|+ '''Table 5. Qualifiers of Implication Ordering: <math>\beta_i f = \Upsilon (f \Rightarrow f_i)</math>'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
With this interpretation in mind we note the following correspondences between classical quantifications and higher order indicator functions:
With this interpretation in mind we note the following correspondences between classical quantifications and higher order indicator functions:
{| align="center" border="1" cellpadding="8" cellspacing="0" style="font-weight:bold; width:90%"
{| align="center" border="1" cellpadding="8" cellspacing="0" style="font-weight:bold; width:96%"
|+ '''Table 7. Syllogistic Premisses as Higher Order Indicator Functions'''
|+ '''Table 7. Syllogistic Premisses as Higher Order Indicator Functions'''
|
|
Tables 8 and 9 develop these ideas in more detail.
Tables 8 and 9 develop these ideas in more detail.
{| align="center" border="1" cellpadding="2" cellspacing="0" style="font-weight:bold; text-align:center; width:100%"
{| align="center" border="1" cellpadding="2" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 8. Relation of Quantifiers to Higher Order Propositions'''
|+ '''Table 8. Relation of Quantifiers to Higher Order Propositions'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
|}<br>
|}<br>
{| align="center" border="1" cellpadding="2" cellspacing="0" style="font-weight:bold; text-align:center; width:90%"
{| align="center" border="1" cellpadding="2" cellspacing="0" style="font-weight:bold; text-align:center; width:96%"
|+ '''Table 9. Simple Qualifiers of Propositions (''n'' = 2)'''
|+ '''Table 9. Simple Qualifiers of Propositions (''n'' = 2)'''
|- style="background:ghostwhite"
|- style="background:ghostwhite"
