  In this short paper, Kuratowski problem will be investigated in vector space.
The highest number of distinct sets that can be generated from one convex set
in linear space by repeatedly applying algebraic closure and complement in any
order is 8. Keywords: Kuratowski problem, algebraic interior, algebraic closure
