Podrobný výpis o publikaci

The paper deals with the fundamental rule of extensional logics, namely the rule of Existential Generalization. This rule can be applied in the situation when a function f is applied on its argument a to obtain the value of f at a. If the application does not fail, i.e., if the function f is defined at a, then we can existentially quantify, and derive that there is the value f(a). Our system is based on Transparent Intensional Logic (TIL). Since TIL is a hyperintensional, partial, typed lambda calculus, we examine the validity of the rule in TIL, or rather in its computational variant the TIL-Script language. The rule is context sensitive in the sense that depending on a context we should recognize the type of entity to be abstracted over. This is not to say that the rule can be invalid dependently on context; the rule is valid universally. Only that the type of the argument over which we quantity depends on the context. There are three kinds of contexts to be distinguished, namely extensional, intensional and hyperintensonal. We introduce the definition of these three kinds of context and an algorithm that recognizes in which context a particular construction occurs so that the Existential Generalization can be validly applied. The tool navigates users through the correct application of the deduction rules.