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 13:20, 9 December 2008
, 13:20, 9 December 2008→Umpire Operators: restore deleted section
===Umpire Operators===
===Umpire Operators===
====Option 1 : Less General Approach====
We now examine measures at the high end of the standard ordering. Instrumental to this purpose we define a couple of higher order operators, <math>\Upsilon_1 : (\mathbb{B}^2 \to \mathbb{B}) \to \mathbb{B}</math> and <math>\Upsilon : (\mathbb{B}^2 \to \mathbb{B}) \times \mathbb{B}^2 \to \mathbb{B}) \to \mathbb{B},</math> both symbolized by cursive upsilon characters and referred to as the absolute and relative "umpire operators", respectively. If either one of these operators is defined in terms of more primitive notions then the remaining operator can be defined in terms of the one first established.
====Option 2 : More General Approach====
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 ''multi-grade'' property of <math>\Upsilon\!</math> can be expressed as a union of function types, in the following manner:
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 ''multi-grade'' property of <math>\Upsilon\!</math> can be expressed as a union of function types, in the following manner:
