The notion of saturated model is dual to the notion of prime model in the following way: let "T" be a countable theory in a first-order language (that is, a set of mutually consistent sentences in that language) and let "P" be a prime model of "T".