In computability theory, a maximal set is a coinfinite computably enumerable subset A of the natural numbers such that for every further computably enumerable subset B of the natural numbers, either B is cofinite or B is a finite variant of A or B is not a superset of A. This gives an easy definition within the lattice of the computably enumerable sets.