Filter Models and Easy Terms
We illustrate the use of intersection types as a tool for synthesizing ?-models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the class of ?-theories induced by graph models is strictly included in the class of ?-theories induced by non-extensional filter models.