Among models of $\lambda$-calculus, some like the Bohm tree model have the property that every element is a directed sup of definable elements, whereas others like the $D_\infty$ and $P(\omega)$ models contain "extra" elements (e.g. step functions) that are not sups of sets of $\lambda$-definable elements.

Does this property have a common name? A model is ___ if every element is a sup of a set of definable elements.

Related properties of similar grammatical form:

• separability of a metric space
• algebraicity of a continuous lattice
• completeness of a partial order or semilattice
• standardness of a model of the reals
• full-abstraction of model of a programming language