12,080
edits
Changes
Talk:Introduction to Inquiry Driven Systems (view source)
Revision as of 13:32, 17 May 2007
, 13:32, 17 May 2007TeX Test
==Notes & Queries==
==Notes & Queries==
[[User:Jon Awbrey|Jon Awbrey]] 06:30, 17 May 2007 (PDT)
[[User:Jon Awbrey|Jon Awbrey]] 06:30, 17 May 2007 (PDT)
==TeX Test==
===Umpire Operators : Version 1===
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 Υ, 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 "multi-grade" property of Υ can be expressed as a union of function types, in the following manner:
: Υ : <font size="+4">∪</font><sup>(m = 1, 2, 3)</sup> (('''B'''<sup>''k''</sup> → '''B''')<sup>''m''</sup> → '''B''').
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:
: Υ<sub>''p''</sub><sup>''r''</sup> ''q'' = Υ(''p'', ''q'', ''r'')
: Υ<sub>''p''</sub><sup>''r''</sup> : ('''B'''<sup>''k''</sup> → '''B''') → '''B'''
The intention of this operator is that we evaluate the proposition ''q'' on each model of the proposition ''p'' and combine the results according to the method indicated by the connective parameter ''r''. In principle, the index ''r'' might specify any connective on as many as 2<sup>''k''</sup> 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 ''p'', ''r'' is assigned a default value that is understood to be in force when the corresponding argument place is left blank, specifically, the constant proposition '''1''' : '''B'''<sup>''k''</sup> → '''B''' for the lower index ''p'', and the continued conjunction or continued product operation Π for the upper index ''r''. Taking the upper default value gives license to the following readings:
{|
| align=right width=36 | 1.
| Υ<sub>''p''</sub> ''q'' = Υ(''p'', ''q'') = Υ(''p'', ''q'', Π).
|-
| align=right width=36 | 2.
| Υ<sub>''p''</sub> = Υ(''p'', __, Π) : ('''B'''<sup>''k''</sup> → '''B''') → '''B'''.
|}
This means that Υ<sub>''p''</sub> ''q'' = 1 if and only if ''q'' holds for all models of ''p''. In propositional terms, this is tantamount to the assertion that ''p'' ⇒ ''q'', or that _(p (q))_ = 1.
Throwing in the lower default value permits the following abbreviations:
{|
| align=right width=36 | 3.
| Υ''q'' = Υ(''q'') = Υ<sub>1</sub> ''q'' = Υ(1, ''q'', Π).
|-
| align=right width=36 | 4.
| Υ = Υ(1, __, Π) : ('''B'''<sup>''k''</sup> → '''B''') → '''B'''.
|}
This means that Υ''q'' = 1 if and only if ''q'' holds for the whole universe of discourse in question, that is, if and only ''q'' is the constantly true proposition '''1''' : '''B'''<sup>''k''</sup> → '''B'''. 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.