There are simple things like, “Alice might have been taller than she is,” whose formalization in modal logic is not so simple. Predicate abstraction provides minimal machinery that represents some of the ideas connecting intension and extension. It has been investigated and applied for many years now. We show how it applies to natural examples like the one just mentioned. This involves discussing syntax and a corresponding semantics. If time permits, we will also sketch a formal proof procedure for predicate abstraction, based on nested sequents, though there will not be time to discuss soundness or completeness.