The issue of reduction of propositions to sets of possible worlds is addressed. It is shown that, under some natural assumptions, there always exist recursive propositions, i.e. decidable sets of possible worlds, which are not assigned to any sentence of a language. Some consequences of this result are discussed.