Directory:Jon Awbrey/Papers/Functional Logic : Higher Order Propositions - Revision history

Jon Awbrey: add categories

2013-07-04T03:12:20Z

add categories

Jon Awbrey: /* Higher Order Propositions and Logical Operators (n = 1) */ force png

2013-05-25T02:22:46Z

Higher Order Propositions and Logical Operators (n = 1): force png

Jon Awbrey: /* Extending the Existential Interpretation to Quantificational Logic */ PNG not displaying -- try the JPEG instead

2012-03-18T17:22:14Z

Extending the Existential Interpretation to Quantificational Logic: PNG not displaying -- try the JPEG instead

Jon Awbrey: /* Application of Higher Order Propositions to Quantification Theory */ restyle tables

2009-11-23T22:22:14Z

Application of Higher Order Propositions to Quantification Theory: restyle tables

Jon Awbrey: sub [ smallmatrix / matrix ] in column heads

2009-11-23T03:20:22Z

sub [ smallmatrix / matrix ] in column heads

Jon Awbrey: add last piece

2009-11-23T03:10:20Z

add last piece

Show changes

Jon Awbrey: add content

2009-11-22T16:10:30Z

add content

Jon Awbrey: /* Measure for Measure */ remove unnecessary parentheses

2009-11-22T14:54:53Z

Measure for Measure: remove unnecessary parentheses

Jon Awbrey: add a bit more

2009-11-22T14:44:13Z

add a bit more

Jon Awbrey: add another piece

2009-11-22T13:26:32Z

add another piece

← Older revision		Revision as of 03:12, 4 July 2013
Line 2,375:		Line 2,375:
	\| Revised: 12 Mar 2004		\| Revised: 12 Mar 2004
	</pre>		</pre>
		+
		+	[[Category:Adaptive Systems]]
		+	[[Category:Artificial Intelligence]]
		+	[[Category:Combinatorics]]
		+	[[Category:Computer Science]]
		+	[[Category:Cybernetics]]
		+	[[Category:Differential Logic]]
		+	[[Category:Discrete Systems]]
		+	[[Category:Dynamical Systems]]
		+	[[Category:Formal Languages]]
		+	[[Category:Formal Sciences]]
		+	[[Category:Formal Systems]]
		+	[[Category:Functional Logic]]
		+	[[Category:Graph Theory]]
		+	[[Category:Group Theory]]
		+	[[Category:Inquiry]]
		+	[[Category:Knowledge Representation]]
		+	[[Category:Linguistics]]
		+	[[Category:Logic]]
		+	[[Category:Logical Graphs]]
		+	[[Category:Mathematics]]
		+	[[Category:Mathematical Systems Theory]]
		+	[[Category:Science]]
		+	[[Category:Semiotics]]
		+	[[Category:Philosophy]]
		+	[[Category:Systems Science]]
		+	[[Category:Visualization]]

@@ Line 27: / Line 27: @@
 <tr>
-<td style="border-bottom:2px solid black" align="right"><math>x:</math></td>
+<td style="border-bottom:2px solid black" align="right"><math>x:\!</math></td>
 <td style="border-bottom:2px solid black"><math>1 ~ 0</math></td>
-<td style="border-bottom:2px solid black; border-right:2px solid black"><math>f</math></td>
+<td style="border-bottom:2px solid black; border-right:2px solid black"><math>f\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{0}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{0}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{1}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{1}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{2}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{2}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{3}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{3}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{4}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{4}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{5}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{5}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{6}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{6}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{7}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{7}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{8}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{8}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{9}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{9}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{10}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{10}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{11}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{11}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{12}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{12}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{13}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{13}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{14}</math></td>
+<td style="border-bottom:2px solid black"><math>m_{14}\!</math></td>
-<td style="border-bottom:2px solid black"><math>m_{15}</math></td></tr>
+<td style="border-bottom:2px solid black"><math>m_{15}\!</math></td></tr>
 <tr>
-<td><math>f_{0}</math></td>
+<td><math>f_{0}\!</math></td>
 <td><math>0 ~ 0</math></td>
-<td style="border-right:2px solid black"><math>\texttt{(~)}</math></td>
+<td style="border-right:2px solid black"><math>\texttt{(~)}\!</math></td>
 <td style="background:white; color:black">0</td>
 <td style="background:black; color:white">1</td>
@@ Line 69: / Line 69: @@
 <tr>
-<td><math>f_{1}</math></td>
+<td><math>f_{1}\!</math></td>
 <td><math>0 ~ 1</math></td>
-<td style="border-right:2px solid black"><math>\texttt{(} x \texttt{)}</math></td>
+<td style="border-right:2px solid black"><math>\texttt{(} x \texttt{)}\!</math></td>
 <td style="background:white; color:black">0</td>
 <td style="background:white; color:black">0</td>
@@ Line 90: / Line 90: @@
 <tr>
-<td><math>f_{2}</math></td>
+<td><math>f_{2}\!</math></td>
 <td><math>1 ~ 0</math></td>
-<td style="border-right:2px solid black"><math>x</math></td>
+<td style="border-right:2px solid black"><math>x\!</math></td>
 <td style="background:white; color:black">0</td>
 <td style="background:white; color:black">0</td>
@@ Line 111: / Line 111: @@
 <tr>
-<td><math>f_{3}</math></td>
+<td><math>f_{3}\!</math></td>
 <td><math>1 ~ 1</math></td>
-<td style="border-right:2px solid black"><math>\texttt{((~))}</math></td>
+<td style="border-right:2px solid black"><math>\texttt{((~))}\!</math></td>
 <td style="background:white; color:black">0</td>
 <td style="background:white; color:black">0</td>

@@ Line 1,567: / Line 1,567: @@
 {| align="center" cellpadding="10" style="text-align:center"
-| [[Image:Venn Diagram 4 Dimensions UV Cacti 8 Inch.png]]
+| [[Image:Venn Diagram 4 Dimensions UV Cacti 8 Inch.jpg]]
 |-
 | <math>\text{Figure 6.} ~~ \text{Higher Order Universe of Discourse} ~ [\ell_{00}, \ell_{01}, \ell_{10}, \ell_{11}] \subseteq [[u, v]]</math>

@@ Line 2,203: / Line 2,203: @@
 <tr>
-<td><math>\mathrm{E}</math><br><math>\mathrm{Exclusive}</math></td>
+<td><math>\begin{matrix}
-<td><math>\mathrm{Universal}</math><br><math>\mathrm{Negative}</math></td>
+\mathrm{E}
 <td><math>\mathrm{All} ~ u ~ \mathrm{is} ~ \texttt{(} v \texttt{)}</math></td>
 <td>&nbsp;</td>
@@ Line 2,211: / Line 2,219: @@
 <tr>
-<td><math>\mathrm{A}</math><br><math>\mathrm{Absolute}</math></td>
+<td style="border-bottom:1px solid black">
-<td><math>\mathrm{Universal}</math><br><math>\mathrm{Affirmative}</math></td>
+<math>\begin{matrix}
-<td><math>\mathrm{All} ~ u ~ \mathrm{is} ~ v</math></td>
+\mathrm{A}
-<td>&nbsp;</td>
+\\
-<td><math>\mathrm{No} ~ u ~ \mathrm{is} ~ \texttt{(} v \texttt{)}</math></td>
+\mathrm{Absolute}
-<td><math>\texttt{(} \ell_{10} \texttt{)}</math></td></tr>
+\end{matrix}</math></td>
 <tr>
@@ Line 2,243: / Line 2,261: @@
 <tr>
-<td>&nbsp;</td>
+<td style="border-bottom:1px solid black">&nbsp;</td>
-<td>&nbsp;</td>
+<td style="border-bottom:1px solid black">&nbsp;</td>
-<td><math>\mathrm{Some} ~ \texttt{(} u \texttt{)} ~ \mathrm{is} ~ v</math></td>
+<td style="border-bottom:1px solid black"><math>\mathrm{Some} ~ \texttt{(} u \texttt{)} ~ \mathrm{is} ~ v</math></td>
-<td>&nbsp;</td>
+<td style="border-bottom:1px solid black">&nbsp;</td>
-<td><math>\mathrm{Some} ~ \texttt{(} u \texttt{)} ~ \mathrm{is} ~ v</math></td>
+<td style="border-bottom:1px solid black"><math>\mathrm{Some} ~ \texttt{(} u \texttt{)} ~ \mathrm{is} ~ v</math></td>
-<td><math>\ell_{01}</math></td></tr>
+<td style="border-bottom:1px solid black"><math>\ell_{01}</math></td></tr>
 <tr>
-<td><math>\mathrm{O}</math><br><math>\mathrm{Obtrusive}</math></td>
+<td><math>\begin{matrix}
-<td><math>\mathrm{Particular}</math><br><math>\mathrm{Negative}</math></td>
+\mathrm{O}
 <td><math>\mathrm{Some} ~ u ~ \mathrm{is} ~ \texttt{(} v \texttt{)}</math></td>
 <td>&nbsp;</td>
@@ Line 2,259: / Line 2,285: @@
 <tr>
-<td><math>\mathrm{I}</math><br><math>\mathrm{Indefinite}</math></td>
+<td><math>\begin{matrix}
-<td><math>\mathrm{Particular}</math><br><math>\mathrm{Affirmative}</math></td>
+\mathrm{I}
 <td><math>\mathrm{Some} ~ u ~ \mathrm{is} ~ v</math></td>
 <td>&nbsp;</td>

@@ Line 1,626: / Line 1,626: @@
 <math>f</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{11} \texttt{)}
 \\
@@ Line 1,632: / Line 1,632: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{10} \texttt{)}
 \\
@@ Line 1,640: / Line 1,640: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{01} \texttt{)}
 \\
@@ Line 1,648: / Line 1,648: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{00} \texttt{)}
 \\
@@ Line 1,656: / Line 1,656: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{00}
 \\
@@ Line 1,664: / Line 1,664: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{01}
 \\
@@ Line 1,672: / Line 1,672: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{10}
 \\
@@ Line 1,680: / Line 1,680: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{11}
 \\
@@ Line 1,688: / Line 1,688: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td></tr>
+\end{smallmatrix}</math></td></tr>
 <tr>
@@ Line 1,914: / Line 1,914: @@
 <math>f</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{11} \texttt{)}
 \\
@@ Line 1,920: / Line 1,920: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{10} \texttt{)}
 \\
@@ Line 1,928: / Line 1,928: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{01} \texttt{)}
 \\
@@ Line 1,936: / Line 1,936: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \texttt{(} \ell_{00} \texttt{)}
 \\
@@ Line 1,944: / Line 1,944: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{00}
 \\
@@ Line 1,952: / Line 1,952: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{01}
 \\
@@ Line 1,960: / Line 1,960: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{10}
 \\
@@ Line 1,968: / Line 1,968: @@
 \\
 \mathrm{is} ~ \texttt{(} v \texttt{)}
-\end{matrix}</math></td>
+\end{smallmatrix}</math></td>
 <td width="10%" style="border-bottom:1px solid black">
-<math>\begin{matrix}
+<math>\begin{smallmatrix}
 \ell_{11}
 \\
@@ Line 1,976: / Line 1,976: @@
 \\
 \mathrm{is} ~ v
-\end{matrix}</math></td></tr>
+\end{smallmatrix}</math></td></tr>
 <tr>

@@ Line 1,508: / Line 1,508: @@
 {| align="center" cellpadding="8"
-| <math>[| \alpha_i |]</math>
+| <math>[| \alpha_{i} |]</math>
 | <math>=</math>
-| <math>(\alpha_i)^{-1}(1),</math>
+| <math>\alpha_{i}^{-1}(1),</math>
 |-
-| <math>[| \beta_i |]</math>
+| <math>[| \beta_{i} |]</math>
 | <math>=</math>
-| <math>(\beta_i)^{-1}(1),</math>
+| <math>\beta_{i}^{-1}(1),</math>
 |-
-| <math>[| \Upsilon_p |]</math>
+| <math>[| \Upsilon_{p} |]</math>
 | <math>=</math>
-| <math>(\Upsilon_p)^{-1}(1).</math>
+| <math>\Upsilon_{p}^{-1}(1).</math>
 |}

← Older revision		Revision as of 14:44, 22 November 2009
Line 1,524:		Line 1,524:

	Up till now quantification theory has been based on the assumption of individual variables ranging over universal collections of perfectly determinate elements. Merely to write down quantified formulas like <math>\forall_{x \in X} f(x)</math> and <math>\exists_{x \in X} f(x)</math> involves a subscription to such notions, as shown by the membership relations invoked in their indices. Reflected on pragmatic and constructive principles, these ideas begin to appear as problematic hypotheses whose warrants are not beyond question, projects of exhaustive determination that overreach the powers of finite information and control to manage. Therefore, it is worth considering how we might shift the medium of quantification theory closer to familiar ground, toward the predicates themselves that represent our continuing acquaintance with phenomena.		Up till now quantification theory has been based on the assumption of individual variables ranging over universal collections of perfectly determinate elements. Merely to write down quantified formulas like <math>\forall_{x \in X} f(x)</math> and <math>\exists_{x \in X} f(x)</math> involves a subscription to such notions, as shown by the membership relations invoked in their indices. Reflected on pragmatic and constructive principles, these ideas begin to appear as problematic hypotheses whose warrants are not beyond question, projects of exhaustive determination that overreach the powers of finite information and control to manage. Therefore, it is worth considering how we might shift the medium of quantification theory closer to familiar ground, toward the predicates themselves that represent our continuing acquaintance with phenomena.
		+
		+	===Extending the Existential Interpretation to Quantificational Logic===
		+
		+	The forms commonly viewed as quantified propositions may be viewed again as propositions about propositions, indeed, there is every reason to regard higher order propositions as the genus of quantification under which the more familiar species appear.
		+
		+	Let us return to the 2-dimensional case <math>X^\circ = [u, v]</math>. In order to provide a bridge between propositions and quantifications it serves to define a set of qualifiers <math>\ell_{ij} : (\mathbb{B}^2 \to \mathbb{B}) \to \mathbb{B}</math> that have the following characters:
		+
		+	{\| align="center" cellpadding="6"
		+	\|
		+	<math>\begin{array}{*{11}{l}}
		+	\ell_{00} f
		+	& = & \ell_{\texttt{(} u \texttt{)(} v \texttt{)}} f
		+	& = & \alpha_{1} f
		+	& = & \Upsilon_{\texttt{(} u \texttt{)(} v \texttt{)}} f
		+	& = & \Upsilon_{\texttt{(} u \texttt{)(} v \texttt{)} ~ \Rightarrow f}
		+	& = & f ~ \operatorname{likes} ~ \texttt{(} u \texttt{)(} v \texttt{)}
		+	\\
		+	\ell_{01} f
		+	& = & \ell_{\texttt{(} u \texttt{)} ~ v} f
		+	& = & \alpha_{2} f
		+	& = & \Upsilon_{\texttt{(} u \texttt{)} ~ v} f
		+	& = & \Upsilon_{\texttt{(} u \texttt{)} ~ v ~ \Rightarrow f}
		+	& = & f ~ \operatorname{likes} ~ \texttt{(} u \texttt{)} ~ v
		+	\\
		+	\ell_{10} f
		+	& = & \ell_{u ~ \texttt{(} v \texttt{)}} f
		+	& = & \alpha_{4} f
		+	& = & \Upsilon_{u ~ \texttt{(} v \texttt{)}} f
		+	& = & \Upsilon_{u ~ \texttt{(} v \texttt{)} ~ \Rightarrow f}
		+	& = & f ~ \operatorname{likes} ~ u ~ \texttt{(} v \texttt{)}
		+	\\
		+	\ell_{11} f
		+	& = & \ell_{u ~ v} f
		+	& = & \alpha_{8} f
		+	& = & \Upsilon_{u ~ v} f
		+	& = & \Upsilon_{u ~ v ~ \Rightarrow f}
		+	& = & f ~ \operatorname{likes} ~ u ~ v
		+	\end{array}</math>
		+	\|}
		+
		+	Intuitively, the <math>\ell_{ij}</math> operators may be thought of as qualifying propositions according to the elements of the universe of discourse that each proposition positively values. Taken together, these measures provide us with the means to express many useful observations about the propositions in <math>X^\circ = [u, v],</math> and so they mediate a subtext <math>[\ell_{00}, \ell_{01}, \ell_{10}, \ell_{11}]</math> that takes place within the higher order universe of discourse <math>X^{\circ 2} = [X^\circ] = [[u, v]].</math> Figure 6 summarizes the action of the <math>\ell_{ij}</math> operators on the <math>f_{i}</math> within <math>X^{\circ 2}.</math>
		+
		+	{\| align="center" cellpadding="10" style="text-align:center"
		+	\| [[Image:Venn Diagram 4 Dimensions UV Cacti 8 Inch.png]]
		+	\|-
		+	\| <math>\text{Figure 6.} ~~ \text{Higher Order Universe of Discourse} ~ [\ell_{00}, \ell_{01}, \ell_{10}, \ell_{11}] \subseteq [[u, v]]</math>
		+	\|}

	==References==		==References==

← Older revision		Revision as of 13:26, 22 November 2009
Line 1,524:		Line 1,524:

	Up till now quantification theory has been based on the assumption of individual variables ranging over universal collections of perfectly determinate elements. Merely to write down quantified formulas like <math>\forall_{x \in X} f(x)</math> and <math>\exists_{x \in X} f(x)</math> involves a subscription to such notions, as shown by the membership relations invoked in their indices. Reflected on pragmatic and constructive principles, these ideas begin to appear as problematic hypotheses whose warrants are not beyond question, projects of exhaustive determination that overreach the powers of finite information and control to manage. Therefore, it is worth considering how we might shift the medium of quantification theory closer to familiar ground, toward the predicates themselves that represent our continuing acquaintance with phenomena.		Up till now quantification theory has been based on the assumption of individual variables ranging over universal collections of perfectly determinate elements. Merely to write down quantified formulas like <math>\forall_{x \in X} f(x)</math> and <math>\exists_{x \in X} f(x)</math> involves a subscription to such notions, as shown by the membership relations invoked in their indices. Reflected on pragmatic and constructive principles, these ideas begin to appear as problematic hypotheses whose warrants are not beyond question, projects of exhaustive determination that overreach the powers of finite information and control to manage. Therefore, it is worth considering how we might shift the medium of quantification theory closer to familiar ground, toward the predicates themselves that represent our continuing acquaintance with phenomena.
		+
		+	==References==
		+
		+	* Quine, W.V. (1969/1981), "On the Limits of Decision", ''Akten des XIV. Internationalen Kongresses für Philosophie'', vol. 3 (1969). Reprinted, pp. 156–163 in Quine (ed., 1981), ''Theories and Things'', Harvard University Press, Cambridge, MA.
		+
		+	==Related Topics==
		+
		+	* [[Directory:Jon_Awbrey/Papers/Functional_Logic_:_Inquiry_and_Analogy\|Functional Logic : Inquiry and Analogy]]
		+
		+	* [[Directory:Jon_Awbrey/Papers/Functional_Logic_:_Quantification_Theory\|Functional Logic : Quantification Theory]]
		+
		+	==Appendix : Generalized Umpire Operators==
		+
		+	In order to get a handle on the space of higher order propositions and eventually to carry out a functional approach to quantification theory, it serves to construct some specialized tools. Specifically, I define a higher order operator <math>\Upsilon,</math> called the ''umpire operator'', which takes up to three propositions as arguments and returns a single truth value as the result. Formally, this so-called ''[[multigrade operator\|multigrade]]'' property of <math>\Upsilon</math> can be expressed as a union of function types, in the following manner:
		+
		+	{\| align="center" cellpadding="8" style="text-align:center"
		+	\| <math>\Upsilon : \bigcup_{\ell = 1, 2, 3} ((\mathbb{B}^k \to \mathbb{B})^\ell \to \mathbb{B}).</math>
		+	\|}
		+
		+	In contexts of application the intended sense can be discerned by the number of arguments that actually appear in the argument list. Often, the first and last arguments appear as indices, the one in the middle being treated as the main argument while the other two arguments serve to modify the sense of the operation in question. Thus, we have the following forms:
		+
		+	{\| align="center" cellpadding="8" style="text-align:center"
		+	\| <math>\Upsilon_p^r q = \Upsilon (p, q, r)</math>
		+	\|-
		+	\| <math>\Upsilon_p^r : (\mathbb{B}^k \to \mathbb{B}) \to \mathbb{B}</math>
		+	\|}
		+
		+	The intention of this operator is that we evaluate the proposition <math>q</math> on each model of the proposition <math>p</math> and combine the results according to the method indicated by the connective parameter <math>r.</math> In principle, the index <math>r</math> might specify any connective on as many as <math>2^k</math> arguments, but usually we have in mind a much simpler form of combination, most often either collective products or collective sums. By convention, each of the accessory indices <math>p, r</math> is assigned a default value that is understood to be in force when the corresponding argument place is left blank, specifically, the constant proposition <math>1 : \mathbb{B}^k \to \mathbb{B}</math> for the lower index <math>p,</math> and the continued conjunction or continued product operation <math>\textstyle\prod</math> for the upper index <math>r.</math> Taking the upper default value gives license to the following readings:
		+
		+	{\| align="center" cellpadding="8" style="text-align:center"
		+	\| <math>\Upsilon_p (q) = \Upsilon (p, q) = \Upsilon (p, q, \textstyle\prod).</math>
		+	\|-
		+	\| <math>\Upsilon_p = \Upsilon (p, \underline{~~}, \textstyle\prod) : (\mathbb{B}^k \to \mathbb{B}) \to \mathbb{B}.</math>
		+	\|}
		+
		+	This means that <math>\Upsilon_p (q) = 1</math> if and only if <math>q</math> holds for all models of <math>p.</math> In propositional terms, this is tantamount to the assertion that <math>p \Rightarrow q,</math> or that <math>\texttt{(} p \texttt{(} q \texttt{))} = 1.</math>
		+
		+	Throwing in the lower default value permits the following abbreviations:
		+
		+	{\| align="center" cellpadding="8" style="text-align:center"
		+	\| <math>\Upsilon q = \Upsilon (q) = \Upsilon_1 (q) = \Upsilon (1, q, \textstyle\prod).</math>
		+	\|-
		+	\| <math>\Upsilon = \Upsilon (1, \underline{~~}, \textstyle\prod)) : (\mathbb{B}^k\ \to \mathbb{B}) \to \mathbb{B}.</math>
		+	\|}
		+
		+	This means that <math>\Upsilon q = 1</math> if and only if <math>q</math> holds for the whole universe of discourse in question, that is, if and only <math>q</math> is the constantly true proposition <math>1 : \mathbb{B}^k \to \mathbb{B}.</math> The ambiguities of this usage are not a problem so long as we distinguish the context of definition from the context of application and restrict all shorthand notations to the latter.
		+
		+	==Document History==
		+
		+	'''Note.''' The above material is excerpted from a project report on [[Charles Sanders Peirce]]'s conceptions of inquiry and analogy. Online formatting of the original document and continuation of the initial project are currently in progress under the title ''[[Directory:Jon_Awbrey/Papers/Functional_Logic_:_Inquiry_and_Analogy\|Functional Logic : Inquiry and Analogy]]''.
		+
		+	{\| width="100%"
		+	\| align="left" \| Author:
		+	\| align="center" \| Jon Awbrey
		+	\| align="right" \| November 1, 1995
		+	\|-
		+	\| align="left" \| Course:
		+	\| align="center" \| Engineering 690, Graduate Project
		+	\| align="right" \| Cont'd from Winter 1995
		+	\|-
		+	\| align="left" \| Supervisors:
		+	\| align="center" \| F. Mili & M.A. Zohdy
		+	\| align="right" \| Oakland University
		+	\|}
		+
		+	<pre>
		+	\| Version: Draft 3.25
		+	\| Created: 01 Jan 1995
		+	\| Relayed: 01 Nov 1995
		+	\| Revised: 24 Dec 2001
		+	\| Revised: 12 Mar 2004
		+	</pre>