Generalized filter models (Q1575259)

In this paper, starting from filters which are a natural generalization of intersection filters [\textit{H. Barendregt, M. Coppo} and \textit{M. Dezani-Ciancaglini}, J. Symb. Logic 48, 931-940 (1983; Zbl 0545.03004)], the existence of filter models and filter semimodels for the \(\lambda\)-calculus is investigated. The construction of filters is based on a Z-semilattice of types in which the subsets having infimum are given by a collection \(Z\), called subset system. The set of representable functions is characterized in the obtained domain. In the case where the properties of the subset system \(Z\) guarantee the existence of a filter model, the proof of soundness and completeness of the associated natural Z-type assignment system is routine.