The paper examines the logical and conceptual foundations of some standard approaches to the interpretation of negation in systems of extended logic programming. Taking one of the most prominent interpretations of logic programs, the stable model semantics and its generalisations, we show how it conforms to a very simple fixpoint condition, called negation-stability, with respect to the least constructive extension, N2, of the intermediate logic of here-and-there.