On a new constant in intuitionistic propositional logic

The classification theorem for the family of all Novikov complete extensions of the intuitionistic propositional logic in the language containing a single additional constant is proved. The algorithmic problem of the conservativeness of calculi in this enriched language over intuitionistic propositional logic is established to be decidable.