This paper develops a denotation and abstract model based on closure operators for concurrent constraint logic programming. The denotational semantics is built domain theoretically and not from the computation sequences. The denotational semantics is related to an operational semantics. The operational semantics distinguishes successful and unsuccessful computations and observes intermediate results of divergent computations. The paper extends to the indeterminate setting, previous work on functional languages with logic variables [9].