Summary: This paper is about a property of certain combinatorial structures, called sequential convexifiability, shown by the first author [“Disjunctive programming: Properties of the convex hull of feasible points”, MSRR No.348, Carnegie Mellon Univ. (Pittsburgh/PA 1974) and Ann. Discrete Math. 5, 3-51 (1979; Zbl 0409.90061)] to hold for facial disjunctive programs. Sequential convexifiability means that the convex hull of a nonconvex set defined by a collection of constraints can be generated by imposing the constraints one by one, sequentially, and generating each time the convex hull of the resulting set. Here we extend the class of problems considered to disjunctive programs with infinitely many terms, also known as reverse convex programs, and give necessary and sufficient conditions for the solution sets of such problems to be sequentially convexifiable. We point out important classes of problems in addition to facial disjunctive programs (for instance, reverse convex programs with equations only) for which the conditions are always satisfied. Finally, we give examples of disjunctive programs for which the conditions are violated, and so the procedure breaks down.