Abstract:
A classification of all Novikov complete extensions of the superintuitionistic logic $L2$ in a language with several extra constants is given. The decidability of the (algorithmic) conservativeness problem for extensions of the form $L2+A(\overline\varphi)$ over $L2$ is established.
Keywords:superintuitionistic logic $L2$, conservativeness problem, language with extra constants, Novikov complete extension, Heyting algebra.