An algebra for finitary ontology or a functionally complete language for the finitary theory of types
Abstract
This paper presents a generalization of a proposal of van Benthem’s who has shown how to provide a canonical name for any object in propositional type theory. Van Benthem’s idea is to characterize any function in the hierarchy by the Boolean values the function takes for any sequence of arguments. The recursive definition of canonical names uses only the abstraction, functional application, the identity operator and the fact that we have a name for the true and the false. We show that this result can be extended to the finite theory of types by the introduction of an algebra on individuals