The aim of this paper is to present a strongly complete first order functional predicate calculus generalized to models containing not only ordinary classical total functions but also arbitrary partial functions. The completeness proof follows Henkin’s approach, but instead of using maximally consistent sets, we define saturated deductively closed consistent sets . This provides not only a completeness theorem but a representation theorem: any SDCCS defines a canonical model which determine a unique partial value for every predicate symbol and any (...) function symbol. Any SDCCS can thus be interpreted as an epistemic state. (shrink)

This paper is about the most important technical problem faced by Structured Meanings Semantics: the reiteration of hyperintensional functors (i.e., functors of -categorial languages of the sort defined by Max Cresswell in [6]). A way to solve this problem in a general and natural way by using Scott's Domains is both suggested and shown. The result is a semantics which unrestrictedly allows reiterations of hyperintensional functors. The semantics is also extended to accommodate -categorial languages with variables.